Reduced-complexity lattice spherical decoding

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

Abstract

Lattice sequential decoders based on a spherical search region, such as the Sphere Decoder and the SB-Stack decoder, implement a tree-search strategy to find the ML solution while visiting only the lattice points that belong to a sphere of a predefined radius. Their computational complexity depends then critically on the choice of the initial sphere radius. We propose in this work novel initial sphere radius selection methods for spherical-region based sequential lattice decoders and show through simulations the complexity reduction allowed by such methods when the Sphere Decoder is used while maintaining ML performance.

Original languageEnglish
Title of host publication2015 12th International Symposium on Wireless Communication Systems, ISWCS 2015 - Proceedings
PublisherVDE Verlag GmbH
Pages676-680
Number of pages5
ISBN (Electronic)9781467365406
DOIs
Publication statusPublished - 15 Apr 2015
Event12th International Symposium on Wireless Communication Systems, ISWCS 2015 - Brussels, Belgium
Duration: 25 Aug 201528 Aug 2015

Publication series

NameProceedings of the International Symposium on Wireless Communication Systems
Volume2016-April
ISSN (Print)2154-0217
ISSN (Electronic)2154-0225

Conference

Conference12th International Symposium on Wireless Communication Systems, ISWCS 2015
Country/TerritoryBelgium
CityBrussels
Period25/08/1528/08/15

Keywords

  • MIMO systems
  • Radius selection
  • Sphere decoding

Fingerprint

Dive into the research topics of 'Reduced-complexity lattice spherical decoding'. Together they form a unique fingerprint.

Cite this