On the complexity of ML lattice decoders for decoding linear full rate space-time codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 206-

  Rekaya, Ghaya ^a   Belfiore, Jean Claude ^a  

^a TELECOM PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ANTENNA ARRAYS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; QUADRATURE AMPLITUDE MODULATION; RAYLEIGH FADING; SIGNAL TO NOISE RATIO; TRELLIS CODES;

MAXIMUM LIKELIHOOD LATTICE DECODERS; SCHNORR-EUCHNER DECODER; SPACE-TIME CODES; SPHERE-DECODER;

DECODING;

EID: 0142008338     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228220     Document Type: Conference Paper

References (4)

1. M. O. Damen and A. Chkeif and J.-C. Belfore, "A universal lattice code decoder for fading channels," IEEE Com. Letters, vol. 4, n., pp. 161-163, May 2000
2. E. Agrell and T. Eriksson and A. Vardy and K. Zeger, "Closest point search in lattices," IEEE Trans. Inform. Theory, vol. 48, n., pp. 2201-2214, August 2002
3. E. Viterbo and J. Boutros, "Lattice Code Decoder for Space-Time Codes," IEEE Trans. Inform. Theory, vol. 45, n., pp. 1639-1642, July 1999
4. S. Galliou and J.-C. Belfiore, "A New Family of Full Rate, Fully Diverse Space-Time Codes Based on Galois Theory," Proc. ISIT, pp. 419, July 2002