Low complexity near-maximum likelihood decoding for MIMO systems

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC

Volumn , Issue , 2009, Pages 2429-2433

  Liang, Ying ^a   Ma, Shaodan ^a   Ng, Tung Sang ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Complexity; MIMO; Radii; Sphere decoder

Indexed keywords

DECODING; MAXIMUM LIKELIHOOD; RADIO COMMUNICATION;

CHANNEL INFORMATION; COMPLEXITY; COMPUTATIONAL SAVINGS; LOWER COMPLEXITY; MAXIMUM-LIKELIHOOD DECODING; NOISE STATISTICS; RADII; SPHERE DECODERS;

MIMO SYSTEMS;

EID: 77952872276     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PIMRC.2009.5450330     Document Type: Conference Paper

References (12)

1. B. Hassibi and H. Vikalo, "On the expected complexity of integer least-squares problems," in Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, 2002. (ICASSP'02), vol. 2, 2002.
2. C. Schnorr and M. Euchner, "Lattice basis reduction: Improved practical algorithms and solving subset sum problems," Mathematical programming, vol. 66, no. 1, pp. 181-199, 1994.
3. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Mathematics of computation, pp. 463-471, 1985.
4. B. Hassibi and H. Vikalo, "On the sphere-decoding algorithm I. Expected complexity," IEEE Transactions on Signal Processing, vol. 53, no. 8 Part 1, pp. 2806-2818, 2005.
5. A. Chan and I. Lee, "A new reduced-complexity sphere decoder for multiple antennasystems," in Proceedings of IEEE International Conference on Communications, 2002. (ICC 2002), vol. 1, 2002.
6. S. Razavizadeh, V. Vakili, and P. Azmi, "A new faster sphere decoder for MIMO systems," in Proceedings of the 3rd IEEE International Symposium on Signal Processing and Information Technology, 2003. (ISSPIT 2003), 2003, pp. 86-89.
7. S. Chen, T. Zhang, and Y. Xin, "Breadth-first tree search MIMO signal detector design and VLSI implementation," in MILCOM, vol. 3. Citeseer, 2005, p. 1470.
8. Z. Guo and P. Nilsson, "Algorithm and implementation of the K-best sphere decoding for MIMO detection," IEEE Journal on selected areas in communications, vol. 24, no. 3, pp. 491-503, 2006.
9. W. Zhao and G. Giarmakis, "Reduced complexity closest point decoding algorithms for random lattices," IEEE Transactions on Wireless Communications, vol. 5, no. 1, pp. 101-111, 2006.
10. Q. Li and Z. Wang, "Improved k-best sphere decoding algorithms for MIMO systems," in Proceedings of 2006 IEEE International Symposium on Circuits and Systems, 2006. (ISCAS 2006), 2006, p. 4.
11. R. Gowaikar and B. Hassibi, "Statistical pruning for near-maximum likelihood decoding," IEEE Transactions on Signal Processing, vol. 55, no. 6 Part 1, pp. 2661-2675, 2007.
12. S. Ross, Introduction to probability models. Academic Pr, 2006.