An efficient greedy scheduler for zero-forcing dirty-paper coding

Author

Dai, Jisheng ; Chang, Chunqi ; Ye, Zhongfu ; Hung, Yeung Sam

Author_Institution

Dept. of Electron. Eng. & Inf. Sci., Univ. of Sci. & Technol. of China, Hefei, China

Volume

57

Issue

7

fYear

2009

fDate

7/1/2009 12:00:00 AM

Firstpage

1939

Lastpage

1943

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^-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.

Keywords

computational complexity; encoding; matrix algebra; scheduling; Householder QR factorization; channel matrix factorization complexity; efficient greedy scheduler; zero-forcing dirty-paper coding; Broadcasting; Decoding; Interference constraints; Laboratories; MIMO; Mobile communication; Processor scheduling; Scheduling algorithm; Transmitters; Transmitting antennas; 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;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/TCOMM.2009.07.070162

Filename

5165386