A branch and bound approach to speed up the sphere decoder

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn III, Issue , 2005, Pages

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

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; MAXIMUM LIKELIHOOD ESTIMATION; PROBLEM SOLVING; SIGNAL TO NOISE RATIO;

BRANCH AND BOUND APPROACH; LOWER BOUNDS; POLYTOPE-RELAXATION; SPHERE DECODER;

DECODING;

EID: 33646812209     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2005.1415738     Document Type: Conference Paper

References (10)

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. T. Coleman and Y. Li, "A reflective Newton method for minimizing a quadratic function subject to bounds on some of the variables," SIAM Journal on Optimization, vol. 6, no. 4, pp. 1040-1058, 1996.
3. G. Golub and C. Van Loan, "Matrix Computations," John Hopkins University Press, 3rd edition, 1996.
4. B. Hassibi, and H. Vikalo, "On the sphere decoding algorithm: part I, the expected complexity," to appear in IEEE Trans. on Signal Processing.
5. S. Boyd and L. Vandenberghe, "Convex Optimization" Cambridge University Press, 2003.
6. 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.
7. H. Vikalo, B. Hassibi and T. Kailath, "Iterative decoding for MIMO channels via modified sphere decoder", IEEE Trans. on Wireless Communications, November, 2004.
8. B. Hochwald and S. ten Brink, "Achieving near-capacity on a multiple-antenna channel", IEEE Trans. on Communications, March, 2003.
9. R. Gowaikar and B. Hassibi, "Efficient maximum-likelihood decoding via statistical pruning", submitted to IEEE Trans. on Information Theory.
10. M. O. Damen, A. Chkeif and J.-C. Belfore, "Lattice code decoder for space-time codes"' IEEE Comm. Let. pp. 161-163, May 2000.