Back to Search
Start Over
A Faster ML Sphere Decoder with Competing Branches
- Source :
- 2005 IEEE 61st Vehicular Technology Conference.
- Publication Year :
- 2005
- Publisher :
- IEEE, 2005.
-
Abstract
- A novel fast recursive sphere decoder with parallel competing branches (P-SD) is proposed for exact maximum-likelihood (ML) detection in multiple-input multiple-output (MIMO) systems. P-SD introduces a novel competition mechanism which makes P-SD dynamically choose the targeted branch to perform a bounded search among the competing parallel branches. In P-SD, the search radius shrinks to the minimum Euclidean distance as early as possible. Numerical results show that P-SD achieves considerable computational complexity reduction even compared with the Schnorr-Euchner enumeration (SEE) based sphere decoder (SE-SD).
Details
- Database :
- OpenAIRE
- Journal :
- 2005 IEEE 61st Vehicular Technology Conference
- Accession number :
- edsair.doi...........a6d9bf2b319803555f1e58a6e8ecb48e