DocumentCode
2062461
Title
A close-to-capacity dirty paper coding scheme
Author
Ten Brink, Stephan ; Erez, Uri
Author_Institution
Realtek Semicond., Irvine, CA, USA
fYear
2004
fDate
27 June-2 July 2004
Firstpage
533
Abstract
An information theoretic framework for the study of efficient known interference cancellation technique is presented in this paper. The dirty paper channel model is given where the arbitrary interference is known at the transmitter is a statistically independent Gaussian random variable with variance. The link to precoding was made and it was shown that the full capacity might be achieved using lattices and MMSE scaling for arbitrary interference. A BCJR detector computes the a posteriori probability (APP) values of the channel code bits, summing over the corresponding coset. Extrinsic information is iteratively passed between BCJR detector and channel decoder. Code design is done using the EXIT chart, achieving an improvement over optimal scalar quantization (SQ).
Keywords
Gaussian channels; channel coding; interference suppression; least mean squares methods; parity check codes; probability; BCJR detector; MMSE scaling; a posteriori probability values; arbitrary interference; channel code bits; channel decoder model; code design; coset dilution; dirty paper coding scheme; extrinsic information; interference cancellation technique; optimal scalar quantization; statistically independent Gaussian random variable; AWGN; Detectors; Doping; Interference; Interleaved codes; Iterative decoding; Lattices; Parity check codes; Quantization; Transmitters;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365573
Filename
1365573
Link To Document