Variation of the fixed-complexity sphere decoder

Kuei Chiang Lai, Cheng Chieh Huang, Jiun Jie Jia

研究成果: Article同行評審

14 引文 斯高帕斯(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.

原文English
文章編號5962393
頁(從 - 到)1001-1003
頁數3
期刊IEEE Communications Letters
15
發行號9
DOIs
出版狀態Published - 2011 九月

All Science Journal Classification (ASJC) codes

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

指紋 深入研究「Variation of the fixed-complexity sphere decoder」主題。共同形成了獨特的指紋。

引用此