Two methods for decreasing the computational complexity of the MIMO ML decoder

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E87-A, Issue 10, 2004, Pages 2571-2576

  Fukatani, Takayuki ^a   Matsumoto, Ryutaroh ^a   Uyematsu, Tomohiko ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Lattice; Maximum likelihood detection; MIMO fading channel; Sphere decoder

Indexed keywords

ALGORITHMS; ANTENNAS; COMPUTATIONAL COMPLEXITY; FADING (RADIO); MAXIMUM LIKELIHOOD ESTIMATION; MOBILE TELECOMMUNICATION SYSTEMS;

LATTICE; MAXIMUM LIKELIHOOD DETECTION; MIMO FADING CHANNEL; QR FACTORIZATION; SPHERE DECODER;

DECODING;

EID: 7544229431     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (12)

1. E. Telatar, "Capacity of multi-antenna Gaussian channels," Europ. Trans. Telecommun., vol.10, pp.585-595, Nov. 1999.
2. G.J. Foschini, "Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas," Bell Labs Tech. J., vol.1, pp.41-59, 1996.
3. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Comput., vol.44, pp.436-471, April 1985.
4. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inf. Theory, vol.45, no.5, pp.1639-1642, July 1999.
5. B. Hassibi and H. Vikalo, "On the sphere decoding algorithm: Part I and II," http://www.systems.caltech.edu/EE/Faculty/babak/pubs/sphere.html
6. M.O. Damen, A. Chkeif, and J.C. Belfiore, "Lattice code decoder for space-time codes," IEEE Commun. Lett., vol.36, no.5, pp.166-168, Jan. 2000.
7. A.M. Chan and I. Lee, "A new reduced-complexity sphere decoder for multiple antenna systems," Proc. ICC, vol.1, pp.460-464, April 2002.
8. D. Wubben, R. Bohnke, J. Rinas, V. Kuhn, and K.D. Kammeyer, "Efficient algorithm for decoding layered space-time codes," Electron. Lett., vol.37, pp.1348-1350, Oct. 2001.
9. M.O. Damen, H.E. Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inf. Theory, vol.49, no.10, pp.2389-2402, Oct. 2003.
10. J. Stoer and R. Bulirsch, Introduction to numerical analysis, 2nd ed., pp.190-197, Springer-Verlag, 1983.
11. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, Data Structures and Algorithms, Chapter 6.3, Addison-Wesley, Reading, MA, 1983.
12. D.E. Knuth, The art of computer programming, vol.2, 2nd ed., Problem 6.41, Addison-Wesley, Reading, MA, 1981.