Practical vector dirty paper coding for MIMO Gaussian broadcast channels

被引:18
作者
Lin, Shih-Chun [1 ,2 ]
Su, Hsuan-Jung [1 ,2 ]
机构
[1] Natl Taiwan Univ, Dept Elect Engn, Taipei 10617, Taiwan
[2] Natl Taiwan Univ, Grad Inst Commun Engn, Taipei 10617, Taiwan
关键词
dirty paper coding; MIMO Gaussian broadcast channel; side-information;
D O I
10.1109/JSAC.2007.070908
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:1345 / 1357
页数:13
相关论文
共 34 条
[1]  
Amraoui A, 2003, 2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, P296
[2]  
[Anonymous], 1971, RATE DISTORTION THEO
[3]  
[Anonymous], 2000, THESIS MIT
[4]   OPTIMAL DECODING OF LINEAR CODES FOR MINIMIZING SYMBOL ERROR RATE [J].
BAHL, LR ;
COCKE, J ;
JELINEK, F ;
RAVIV, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) :284-287
[5]   Superposition coding for side-information channels [J].
Bennatan, A ;
Burshtein, D ;
Caire, G ;
Shamai, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) :1872-1889
[6]   WRITING ON DIRTY PAPER [J].
COSTA, MHM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :439-441
[7]  
Cover TM, 2006, Elements of Information Theory
[8]   Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels [J].
El Gamal, H ;
Caire, G ;
Damen, MO .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (06) :968-985
[9]   Capacity and lattice strategies for canceling known interference [J].
Erez, U ;
Shamai, S ;
Zamir, R .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (11) :3820-3833
[10]   A close-to-capacity dirty paper coding scheme [J].
Erez, U ;
ten Brink, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (10) :3417-3432