Sphere decoding algorithms with improved radius search

Research output: Contribution to journalArticlepeer-review

68 Scopus citations

Abstract

We start by identifying a relatively efficient version of sphere decoding algorithm (SDA) that performs exact maximum-likelihood (ML) decoding. We develop novel algorithms based on an improved increasing radius search (IIRS), which offer error performance and decoding complexity between two extremes: the ML receiver and the nulling-canceling (NC) receiver with detection ordering. With appropriate choices of parameters, our IIRS offers the flexibility to trade error performance for complexity. We provide design intuitions and guidelines, analytical parameter specifications, and a semianalytical error-performance analysis. Simulations illustrate that IIRS achieves considerable complexity reduction, while maintaining performance close to ML.

Original languageEnglish (US)
Pages (from-to)1104-1109
Number of pages6
JournalIEEE Transactions on Communications
Volume53
Issue number7
DOIs
StatePublished - Jul 1 2005

Keywords

  • Closest-point algorithm
  • Multiple-input multiple-output (MIMO) decoding
  • Sphere decoding

Fingerprint Dive into the research topics of 'Sphere decoding algorithms with improved radius search'. Together they form a unique fingerprint.

Cite this