Abstract
Sphere decoding (SD) allows to solve high-dimensional MIMO maximum likelihood detection problems with significantly lower complexity than other methods. The SD algorithm has, however, mostly only been analyzed with DSP implementations in mind. We show that VLSI implementations call for new performance metrics, analyze the resulting implementation tradeoffs for the decoding of complex signal constellations, and we develop design guidelines and a generic architecture. When using the ℓ∞-norm for the sphere constraint instead of the ℓ2-norm, significant reductions in circuit complexity and improvements in tree pruning efficiency are possible at a minimum performance penalty. As a proof of concept, a high performance ASIC implementation is presented.
Original language | English |
---|---|
Pages (from-to) | 93-97 |
Number of pages | 5 |
Journal | IEE Conference Publication |
Issue number | 503 |
DOIs | |
Publication status | Published - 2004 |
Externally published | Yes |
Event | Fith IEE International Conference on 3G Mobile Communication Technologies 2004 - The Premier Technical Conference for 3G and Beyond - London, United Kingdom Duration: 18 Oct 2004 → 20 Oct 2004 |