VLSI implementation of the sphere decoding algorithm

A. Burg*, M. Wenk, M. Zellweger, M. Wegmueller, N. Felber, W. Fichtner

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

24 Citations (Scopus)

Abstract

Maximum likelihood detection is an essential part of high-performance multiple-input-multiple-output (MIMO) communication systems. While it is attractive due to its superior performance (in terms of BER) its complexity using a straight forward exhaustive search grows exponentially with the number of antennas and the order of the modulation scheme. Sphere decoding is a promising method to reduce the average decoding complexity significantly without compromising performance. This paper discusses the VLSI implementation of the sphere decoder and presents the first implementation of the algorithm that does not compromise BER performance.

Original languageEnglish
Title of host publicationESSCIRC 2004 - Proceedings of the 30th European Solid-State Circuits Conference
EditorsM. Steyaert, C.L. Claeys
Pages303-306
Number of pages4
Publication statusPublished - 2004
Externally publishedYes
EventESSCIRC 2004 - Proceedings of the 30th European Solid-State Circuits Conference - Leuven, Belgium
Duration: 21 Sept 200423 Sept 2004

Publication series

NameESSCIRC 2004 - Proceedings of the 30th European Solid-State Circuits Conference

Conference

ConferenceESSCIRC 2004 - Proceedings of the 30th European Solid-State Circuits Conference
Country/TerritoryBelgium
CityLeuven
Period21/09/0423/09/04

Fingerprint

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

Cite this