Performance tradeoffs in the VLSI implementation of the sphere decoding algorithm

A. Burg*, M. Borgmann, C. Simon, M. Wenk, M. Zellweger, W. Fichtner

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

15 Citations (Scopus)

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 languageEnglish
Pages (from-to)93-97
Number of pages5
JournalIEE Conference Publication
Issue number503
DOIs
Publication statusPublished - 2004
Externally publishedYes
EventFith IEE International Conference on 3G Mobile Communication Technologies 2004 - The Premier Technical Conference for 3G and Beyond - London, United Kingdom
Duration: 18 Oct 200420 Oct 2004

Fingerprint

Dive into the research topics of 'Performance tradeoffs in the VLSI implementation of the sphere decoding algorithm'. Together they form a unique fingerprint.

Cite this