An efficient greedy scheduler for zero-forcing dirty-paper coding
Jisheng Dai, Chunqi Chang, Zhongfu Ye, Yeung Sam Hung · IEEE Transactions on Communications · 2009
In this paper, an efficient greedy scheduler for zero-forcing dirty-paper coding (ZF-DPC), which can be incorporated in complex Householder QR factorization of the channel matrix, is proposed. The ratio of the complexity of the proposed scheduler to the complexity of the channel matrix factorization required by ZF-DPC is O(M-1), while such ratio for the original greedy scheduler is O(M), where M is the number of transmitters. Therefore, the new scheduler reduces the overhead of scheduling from being the bottleneck of ZF-DPC to being negligible.