A new reduced-complexity sphere decoder for multiple antenna systems

IEEE International Conference on Communications

Volumn 1, Issue , 2002, Pages 460-464

  Chan, Albert M ^a   Lee, Inkyu ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b AGERE SYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODE DIVISION MULTIPLE ACCESS; COMPUTATIONAL COMPLEXITY; GAUSSIAN NOISE (ELECTRONIC); MATRIX ALGEBRA; MAXIMUM LIKELIHOOD ESTIMATION; SIGNAL ENCODING; VECTORS;

MULTIPLE ANTENNA SYSTEMS;

RECEIVING ANTENNAS;

EID: 0036282015     PISSN: 05361486     EISSN: None     Source Type: Journal    
DOI: 10.1109/ICC.2002.996896     Document Type: Article

References (10)

1. On the computation of lattice vectors of minimal length, successive minima and reduced basis with applications
2. Improved methods for calculating vectors of short length in a lattice, including a complexity analysis
3. A universal lattice decoder
4. Euclidean space lattice decoding for joint detection in CDMA systems
5. Lattice code decoder for space-time codes
6. Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture
7. Generalized sphere decoder for asymmetrical space-time communication architecture
8. Further results on the sphere decoder algorithm
9. Achieving near-capacity on a multiple-antenna channel
10. A universal lattice code decoder for fading channels