[KSCI] Korea Science Citation Index Service

Reduced Complexity Schnorr-Euchner Sphere Decoders in MIMO Applications

Le Minh-Tuan (School of Engineering, Information and Communications University (ICU))
Pham Van-Su (School of Engineering, Information and Communications University (ICU))
Mai Linh (School of Information and Communications University (ICU))
Yoon Gi-Wan (Information and Communications University (ICU))

Publication Information

Journal of information and communication convergence engineering / v.4, no.2, 2006 , pp. 79-83 More about this Journal

Abstract

We present two techniques based on lookup tables to reduce complexity of the well-known Schnorr-Euchner (SE) sphere decoder (SD) without introducing performance degradation. By the aid of lookup tables, the computational loads caused by the SE enumeration and decision feedback are reduced at the cost of higher storage capacity. Simulation results are provided to verify performance and complexity of the proposed decoders.

Keywords

Multiple-input multiple-output; sphere decoding; maxmum likelihood detection; wireless communication;

Citations & Related Records

Reference

1	M.O. Damen, A. Chkeif, and J. Belfiore, 'Lattice code decoder for space-time codes,' IEEE Commun. Lett., vol. 4, pp. 161-163, May 2000 DOI ScienceOn
2	G. J. Foschini and M. J. Gans, 'On limits of wireless communications in a fading environment when using multiple antennas,' Wireless Personal Communications, vol. 6, pp. 311-335,1998 DOI
3	E. Agrell, T. Eriksson, A. Vardy, and K Zeger, 'Closest point search in lattices,' IEEE Trans. Inform. Theory, vol. 48, no. 8, pp. 2201-2214, Aug. 2002 DOI ScienceOn
4	M.O. Damen, H.E. Gamal, and G. Caire, 'On maximum-likelihood detection and the search for the closest lattice point,' IEEE Trans. Inform. Theory, vol. 49, no. 10, Oct. 2003
5	E. Viterbo and J. Boutros, 'A universal lattice code decoder for fading channels,' IEEE Trans. Inform. Theory, vol. 45, pp. 1639-1642, July 1999 DOI ScienceOn