A universal lattice code decoder for fading channels

IEEE Transactions on Information Theory

Volumn 45, Issue 5, 1999, Pages 1639-1642

  Viterbo, Emanuele ^a,b,c   Boutros, Joseph ^a,d  

^a IEEE   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c POLITECNICO DI TORINO   (Italy)

^d TELECOM PARISTECH   (France)

Author keywords

Lattices; Maximum likelihood decoding; Modulation; Wireless channel

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); FADING (RADIO); MAXIMUM LIKELIHOOD ESTIMATION; MODULATION; VECTOR QUANTIZATION; WIRELESS TELECOMMUNICATION SYSTEMS;

LATTICE CODES; MAXIMUM LIKELIHOOD DECODING; WIRELESS CHANNEL;

DECODING;

EID: 0032636505     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.771234     Document Type: Article

References (8)

1. J. H. Conway and N. J. Sloane, Sphere Packings, Lattices and Groups, 2nd ed. New York: Springer-Verlag, 1993.
2. G. D. Forney Jr., "A bounded distance decoding algorithm for the Leech lattice with generalizations," IEEE Trans. Inform. Theory, vol. 35, pp. 906-909, July 1989.
3. A. Gersho and R. M. Gray, Vector Quantization and Signal Compression. Boston, MA: Kluwer, 1992.
4. J. Boutros, E. Viterbo, C. Rastello, and J. C. Belfiore, "Good lattice constellations for both Rayleigh fading and Gaussian channels," IEEE Trans. Inform. Theory, vol. 42, pp. 502-518, Mar. 1996.
5. J. Boutros and E. Viterbo, "Rotated multidimensional QAM constellations for Rayleigh fading channels," in Proc. 1996 IEEE Information Theory Workshop (Haifa, Israel, June 9-13, 1996), p. 23.
6. M. Pohst, "On the computation of lattice vectors of minimal length, successive minima and reduced basis with applications," ACM SIGSAM Bull., vol. 15, pp. 37-44, 1981.
7. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Comput., vol. 44, pp. 463-471, Apr. 1985.
8. eme Colloq. GRETSI (Juan-les-Pins, France, Sept. 1993), pp. 611-614.