Practical vector dirty paper coding for MIMO gaussian broadcast channels

24Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recently, the vector dirty paper coding (DPC) achievable rate region has been shown to be the capacity region of a multiple-input multiple-output Gaussian broadcast channel (MIMO GBC). With DPC, the multiuser interference noncausally known at the transmitter can be completely removed. In this paper, we present a vector DPC structure for MIMO GBC. It is a generalization of the single antenna superposition dirty paper coding for the scalar Gaussian dirty paper problem proposed by Bennatan et al. In a theoretical random code setting, this construction is shown to be able to achieve the promised rate performance of the MIMO GBC. We also implement it with existing vector quantizer and capacity-achieving channel coding. Combined with iterative decoding, a design example validates the effectiveness of our methods. © 2007 IEEE.

Cite

CITATION STYLE

APA

Lin, S. C., & Su, H. J. (2007). Practical vector dirty paper coding for MIMO gaussian broadcast channels. IEEE Journal on Selected Areas in Communications, 25(7), 1345–1357. https://doi.org/10.1109/JSAC.2007.070908

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free