Conference proceeding
A fast recursive sphere decoder with linear storage
APCC/MDMC '04. The 2004 Joint Conference of the 10th Asia-Pacific Conference on Communications and the 5th International Symposium on Multi-Dimensional Mobile Communications Proceeding, Vol.1, pp.34-38 vol.1
2004
DOI: 10.1109/APCC.2004.1391646
Abstract
A novel fast recursive sphere decoder with competitive extension (CR-SD) is proposed for the exact maximum-likelihood (ML) detection in multiple-input multiple output (MIMO) system. CR-SD introduces a novel competition mechanism which enables the sub-trees to be searched in an optimized order and makes the search radius shrink to the minimum Euclidean distance as early as possible. Numerical results show that CR-SD achieves considerable computation complexity reduction even compared with the fastest ML Schnorr-Euchner enumeration (SEE) based sphere decoder (SE-SD) in literature. Unlike the ML stack [V. Sandrine et al., May 2002] [S. Baro et al., May 2003] or branch-and-bound (BBD) detectors [J. Luo et al., May 2003] in which the storage requirement is random and the exponential in worst case, CR-SD maintains the negligible storage upper-bounded by a deterministic constant linear with the search dimensions.
Details
- Title: Subtitle
- A fast recursive sphere decoder with linear storage
- Creators
- Weiyu Xu - Tsinghua UniversityYouzheng Wang - Tsinghua UniversityAnxin Li - Tsinghua UniversityZucheng Zhou - Tsinghua UniversityJing Wang - Tsinghua University
- Resource Type
- Conference proceeding
- Publication Details
- APCC/MDMC '04. The 2004 Joint Conference of the 10th Asia-Pacific Conference on Communications and the 5th International Symposium on Multi-Dimensional Mobile Communications Proceeding, Vol.1, pp.34-38 vol.1
- DOI
- 10.1109/APCC.2004.1391646
- Publisher
- IEEE
- Language
- English
- Date published
- 2004
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984198002802771
Metrics
15 Record Views