A low-complexity near-ml decoding technique via reduced dimension list stack algorithm

SAM 2008 - 5th IEEE Sensor Array and Multichannel Signal Processing Workshop

Volumn , Issue , 2008, Pages 41-44

  Jun, Won Choi ^a   Byonghyo, Shim ^b   Singer, Andrew C ^a   Nam, Ik Cho ^c  

^a United States of America   (United States)

^b Korea University   (South Korea)

^c Seoul National University   (South Korea)

Author keywords

Dimension reduction; Maximum likelihood; MIMO; Sphere decoding; Tree search

Indexed keywords

ACOUSTIC MICROSCOPES; ALGORITHMS; AMPLITUDE MODULATION; CHEMICAL SENSORS; CHLORINE COMPOUNDS; COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION EQUIPMENT; DATA COMMUNICATION SYSTEMS; MAXIMUM LIKELIHOOD; MISSILE BASES; SENSOR ARRAYS; SENSORS; SIGNAL PROCESSING;

COMPLEXITY REDUCTION; DIMENSION REDUCTION; K CLOSEST POINTS; LOW-COMPLEXITY; MAXIMUM-LIKELIHOOD DECODING; MIMO; ML DECODING; ML DECODING ALGORITHMS; MULTICHANNEL SIGNAL PROCESSING; PERFORMANCE LOSSES; SEARCH SPACES; SPHERE DECODING; SPHERE DECODING ALGORITHM; STACK ALGORITHM; TREE SEARCH; V-BLAST;

DECODING;

EID: 52949154658     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SAM.2008.4606820     Document Type: Conference Paper

References (8)

1. U. Fincke and M. Phost, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Comput., vol. 44, pp. 463-471, Apr. 1985.
2. M. O. Damen, H. E. Gamei, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Information Theory, vol. 49, pp. 2389-2402, Oct. 2003.
3. A. D. Murugan, H. E. Gamal, M. O. Damen, and G. Caire, "A unified framework for tree search decoding: rediscovering the sequential decoder," IEEE Trans. Information Theory, vol. 52, pp. 933-953, March 2006.
4. F. Jelinek, "A fast sequential decoding algorithm using a stack," IBM J. Res. Develop., vol. 13, pp. 675-685, Nov. 1969.
5. P. W. Wolniansky, G. J. Foschini, G. D. Golden, and R. A. Valenzuela, "V-BLAST: An architecture for realizaing very high data rates over the rich-scattering wireless channel," Proc. URSI Int. Symp. Signals, Syst., Electron., pp. 295-300, Sep. 1998.
6. W. Zhao and G. B. Giannakis, "Reduced complexity closest point decoding algorithms for random lattices," IEEE Trans. Wireless Commun., vol. 5, pp. 101-111, Jan. 2006.
7. B. Hochwald and S. T. Brink, "Achieving near-capacity on a multiple-antenna channel," IEEE Trans. Commun., vol. 51, pp. 389-399, Mar. 2003.
8. J. Hagenauer and C. Kuhn, "The list-sequential (LISS) algorithm and its application," IEEE Trans. Commun., vol. 55, pp. 918-928, May 2007.