Computing the Computational Complexity of an Efficient Algorithm for Greedy ZF-DP Precoding Method in MIMO Broadcast Channels

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