Conference proceeding
A computationally efficient exact ML sphere decoder
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04, Vol.4, pp.2594-2598 Vol.4
2004
DOI: 10.1109/GLOCOM.2004.1378474
Abstract
Low-complexity tree search based exact maximum-likelihood (ML) detectors have gained attention for optimum signal detection in multiple-input multiple output (MIMO) wireless systems. In this paper, taking a fresher look at the closet lattice point search problem, we propose a new fast exact ML sphere decoder with ever-increasing radius (IR-SD). It is shown that IR-SD visits minimum number of tree nodes and is more computationally efficient than existing sphere decoders. IR-SD is also faster and requires less storage than ML stack detector. An upper-bound of expected computation and storage complexity of IR-SD independent of tree radius is derived. Numerical results validate that IR-SD greatly speeds up the ML detection than other sphere detectors while requiring less storage than ML stack algorithm. A factor-of-2.5 speed-up is observed over the depth-first Schnorr-Euchner sphere decoders when utilizing IR-SD in 16-QAM 10/spl times/10 complex MIMO system.
Details
- Title: Subtitle
- A computationally efficient exact ML sphere decoder
- Creators
- Weiyu Xu - Tsinghua UniversityYouzheng Wang - Tsinghua UniversityZucheng Zhou - Tsinghua UniversityJing Wang - Tsinghua University
- Resource Type
- Conference proceeding
- Publication Details
- IEEE Global Telecommunications Conference, 2004. GLOBECOM '04, Vol.4, pp.2594-2598 Vol.4
- DOI
- 10.1109/GLOCOM.2004.1378474
- Publisher
- IEEE
- Language
- English
- Date published
- 2004
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984198006402771
Metrics
17 Record Views