Title :
The modulo loss in lattice dirty-paper coding
Author_Institution :
Dept. of Electr. Eng.-Syst., Tel Aviv Univ., Tel Aviv, Israel
fDate :
June 29 2014-July 4 2014
Abstract :
Lattice decoding of a lattice-shaped codebook is a simple alternative for ML decoding, and it is equivalent to ML decoding after modulo-lattice reduction of the channel output. For good (high-dimensional) lattices, this modulo operation is information lossless in the presence of AWGN. At a finite shaping dimension, however, the lattice decoder is inferior to direct ML decoding from the channel output. The “modulo loss” is particularly large at low SNR, and it gets up to 4dB for scalar shaping. We consider the effect of a known interference (i.e., a dirty-paper channel) on the gap between the two decoders. We show that in the limit of a strong interference, the modulo output becomes a sufficient statistic for decoding the input. Thus, in the strong-interference regime, ML decoding suffers the same “modulo loss” as lattice decoding.
Keywords :
AWGN channels; encoding; AWGN; ML decoding; channel output; finite shaping dimension; information lossless; lattice decoding; lattice dirty paper coding; lattice shaped codebook; modulo lattice reduction; modulo loss; scalar shaping; Decoding; Encoding; Interference; Lattices; Signal to noise ratio; Vectors; ML decoding; dirty-paper coding; known interference; lattice encoding and decoding; modulo-lattice; structured binning; sufficient statistics;
Conference_Titel :
Information Theory (ISIT), 2014 IEEE International Symposium on
Conference_Location :
Honolulu, HI
DOI :
10.1109/ISIT.2014.6875242