Variation of the fixed-complexity sphere decoder

Kuei Chiang Lai, Cheng Chieh Huang, Jiun Jie Jia

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)


The fixed-complexity sphere decoder is a near-optimum tree search detector for the spatial multiplexing scheme. The search tree is statically divided into a full expansion stage and a single expansion stage. To enable the power-saving design and to achieve a lower average complexity with little performance loss, we propose an algorithm that adapts, based on the channel conditions, the switching point between the two stages. The algorithm preserves the capability of parallel processing and pipelining in tree search, and yields predictable complexities.

Original languageEnglish
Article number5962393
Pages (from-to)1001-1003
Number of pages3
JournalIEEE Communications Letters
Issue number9
Publication statusPublished - 2011 Sept

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Variation of the fixed-complexity sphere decoder'. Together they form a unique fingerprint.

Cite this