An H-infinity based lower bound to speed up the sphere decoder

IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC

Volumn 2005, Issue , 2005, Pages 751-755

  Stojnic, M ^a   Vikalo, H ^a   Hassibi, B ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL COMMUNICATION; LEAST-SQUARES PROBLEM; SPHERE DECODING;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; PROBLEM SOLVING; SIGNAL TO NOISE RATIO;

DECODING;

EID: 33745494686     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPAWC.2005.1506240     Document Type: Conference Paper

References (8)

1. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Mathematics of Computation, vol. 44, pp. 463-471, April 1985.
2. G. Golub and C. Van Loan, "Matrix Computations," John Hopkins University Press, 3rd edition, 1996.
3. B. Hassibi, and H. Vikalo, "On the sphere decoding algorithm: part I, the expected complexity," to appear in IEEE Trans. on Signal Processing.
4. H. Artes, D. Seethaler and F. Hlawatsch, "Efficient detection algorithms for MIMO channels: A geometrical approach to approximate ML detection," IEEE Trans. on Signal Processing, November, 2003.
5. R. Gowaikar and B. Hassibi, "Efficient maximum-likelihood decoding via statistical pruning", submitted to IEEE Trans. on Information Theory.
6. M. O. Damen, A. Chkeif and J.-C. Belfore, "Lattice code decoder for space-time codes"' IEEE Comm. Let. pp. 161-163, May 2000.
7. M. Stojnic, H. Vikalo and B. Hassibi, "A branch and bound approach to speed up the sphere decoder", ICASSP, International conference on Acoustics, Speech and Signal Processing, Philadelphia, March, 2005.
8. B. Hassibi, A. H. Sayed, and T. Kailath, Indefinite-Quadratic Estimation and Control SIAM, 1999.