Low complexity list detection for high-rate multiple-antenna channels

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 273-

  Reid, Aaron B ^a   Grant, Alex J ^a   Kind, Adriel P ^a  

^a UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ANTENNAS; APPROXIMATION THEORY; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; DECODING; ITERATIVE METHODS; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBABILITY; QUADRATURE AMPLITUDE MODULATION;

MULTIPLE ANTENNA CHANNELS; MULTIPLE INPUT MULTIPLE OUTPUT CHANNELS;

DATA COMMUNICATION SYSTEMS;

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

References (4)

1. B. M. Hochwald and S. ten Brink, "Achieving near-capacity on a multiple-antenna channel," Submitted to IEEE Trans. Comm., Jul. 2001.
2. B. Hassibi and H. Vikalo, "On the expected complexity of sphere decoding," Conf. Rec. of the Thirty-Fifth Asilomar Conf. on Sys. and Comp. Sign., pp. 1051-1055, Nov. 2001.
3. D. Eppstein, "Finding the k shortest paths," Tech. Rep., Dep. of Info. and Comp. Sci., University of California, 1994.
4. C. Schlegel, Trellis Coding, IEEE Press, 1997.