Seyyed Ali Erfani - Sadjad Institute of Higher Education Mashhad Iran, Author’s Address: No. ۲۷, Yaser Street, Niyavaran Avenue,
Iman Ahadi Akhlaghi - Sadjad Institute of Higher Education, Mashhad, Iran,

In this work we analyze a precoding method in MIMO broadcast channels which is called ZF-DP. ( QR Decomposition with Dirty Paper coding ) There is an algorithm for reducing the computational complexity of the ZF-DP method with greedy user selection. In this paper the computational complexity of this algorithm is computed when the channel matrix is full rank or rank deficient.

Broadcast Network, ZF-DP Precoding, Greedy User Selection, Householder Method