Title :
A close-to-capacity dirty paper coding scheme
Author :
Erez, Uri ; ten Brink, Stephan
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Massachusetts Inst. of Technol., Cambridge, MA, USA
Abstract :
The "writing on dirty paper"-channel model offers an information-theoretic framework for precoding techniques for canceling arbitrary interference known at the transmitter. It indicates that lossless precoding is theoretically possible at any signal-to-noise ratio (SNR), and thus dirty-paper coding may serve as a basic building block in both single-user and multiuser communication systems. We design an end-to-end coding realization of a system materializing a significant portion of the promised gains. We employ multidimensional quantization based on trellis shaping at the transmitter. Coset decoding is implemented at the receiver using "virtual bits." Combined with iterative decoding of capacity-approaching codes we achieve an improvement of 2dB over the best scalar quantization scheme. Code design is done using the EXIT chart technique.
Keywords :
channel capacity; channel coding; interference suppression; iterative decoding; least mean squares methods; multiuser channels; trellis codes; vector quantisation; EXIT chart technique; MMSE; capacity-approaching codes; channel coding; coset decoding; dirty-paper coding; end-to-end coding; interference cancellation; iterative decoding; minimum mean-squared error estimation; multiuser communication; mutual information; precoding technique; repeat-accumulate codes; single-user systems; trellis shaping; vector quantization; AWGN; Communication systems; Interference cancellation; Interference constraints; Iterative decoding; MIMO; Multidimensional systems; Quantization; Signal to noise ratio; Transmitters; Dirty paper coding; EXIT chart; interference cancellation; iterative decoding; minimum mean-squared error (MMSE) estimation; mutual information; repeat–accumulate (RA) codes; vector quantization;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2005.855586