Lattice reduction aided selective spanning with fast enumeration for soft-output MIMO detection

Ubaid Ahmad, Min Li, Sofie Pollin, Claude Desset, Liesbet Van Der Perre, Rudy Lauwereins

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

Abstract

Lattice Reduction (LR) is a promising technique to improve the performance of linear MIMO detectors. However, LR-aided linear hard output MIMO detection is still far from optimal. Practical systems use soft output information to exploit gains from forward-error-correcting codes to achieve near-optimal performance. In this paper, LR-aided Selective Spanning with Fast Enumeration (LR-SSFE) is proposed as a candidate list generation method for soft output MIMO detection. The proposed algorithm uses heuristics based on simple arithmetic operations, which results in a completely deterministic and regular data flow. Hence, LR-SSFE can be efficiently implemented on a parallel programmable architecture. LR-SSFE is compared to the Fixed Candidates Algorithm (FCA) in terms of performance and complexity, which is another LR-aided candidate list generation method. Under the same performance constraints LR-SSFE has a significantly lower complexity than FCA.

Original languageBritish English
Title of host publicationProceedings of the 20th European Signal Processing Conference, EUSIPCO 2012
Pages51-55
Number of pages5
StatePublished - 2012
Event20th European Signal Processing Conference, EUSIPCO 2012 - Bucharest, Romania
Duration: 27 Aug 201231 Aug 2012

Publication series

NameEuropean Signal Processing Conference
ISSN (Print)2219-5491

Conference

Conference20th European Signal Processing Conference, EUSIPCO 2012
Country/TerritoryRomania
CityBucharest
Period27/08/1231/08/12

Fingerprint

Dive into the research topics of 'Lattice reduction aided selective spanning with fast enumeration for soft-output MIMO detection'. Together they form a unique fingerprint.

Cite this