Low complexity list updating circuits for list sphere decoders

Yuping Zhang, Jun Tang, Keshab K Parhi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

Abstract

Sphere decoder has been introduced to the multiple-input-multiple-output (MIMO) communication systems, with which the maximum likelihood (ML) detection becomes feasible. In order to combine the sphere decoders with the outer channel code decoder, researchers have proposed to include a candidate list in the sphere decoder to provide soft information to the channel code decoder. This algorithm is called list sphere decoder (LSD). In the LSD, different from the conventional sphere decoder (CSD), the candidate list introduces significant hardware overhead. In this paper, we propose to use a tree-type comparator array, a link table and sublists to reduce the hardware complexity of inserting new candidates into the list. Combining these techniques, we can reduce the complexity by around 90% compared with the straightforward implementations.

Original languageEnglish (US)
Title of host publication2006 IEEE Workshop on Signal Processing Systems Design and Implementation, SIPS
Pages28-33
Number of pages6
DOIs
StatePublished - 2006
EventIEEE Workshop on Signal Processing Systems, SIPS 2006 - Banff, AB, Canada
Duration: Oct 2 2006Oct 4 2006

Publication series

Name2006 IEEE Workshop on Signal Processing Systems Design and Implementation, SIPS

Other

OtherIEEE Workshop on Signal Processing Systems, SIPS 2006
CountryCanada
CityBanff, AB
Period10/2/0610/4/06

Fingerprint Dive into the research topics of 'Low complexity list updating circuits for list sphere decoders'. Together they form a unique fingerprint.

Cite this