1. An efficient greedy scheduler for zero-forcing dirty-paper coding
- Author
-
Jisheng, Dai, Chunqi, Chang, Zhongfu, Ye, and Yeung, Sam Hung
- Subjects
MIMO communications -- Methods ,Coding theory - Abstract
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.sup.-1]), while such ratio for the original greedy scheduler is O(M), where Mis the number of transmitters. Therefore, the new scheduler reduces the overhead of scheduling from being the bottleneck of ZF-DPC to being negligible. Index Terms--Efficient greedy scheduler, multiple-input multiple-output (MIMO), vector Gaussian broadcast channel (GBC), zero-forcing dirty-paper coding (ZF-DPC), QR factorization by Householder transformation.
- Published
- 2009