Real-valued fixed-complexity sphere decoder for high dimensional QAM-MIMO systems

Chengwei Zheng, Xuezheng Chu, John McAllister, Roger Woods

Research output: Contribution to journalArticlepeer-review

41 Citations (Scopus)
1 Downloads (Pure)


The development of high performance, low computational complexity detection algorithms is a key challenge for real-time Multiple-Input Multiple-Output (MIMO) communication system design. The Fixed-Complexity Sphere Decoder (FSD) algorithm is one of the most promising approaches, enabling quasi-ML decoding accuracy and high performance implementation due to its deterministic, highly parallel structure. However, it suffers from exponential growth in computational complexity as the number of MIMO transmit antennas increases, critically limiting its scalability to larger MIMO system topologies. In this paper, we present a solution to this problem by applying a novel cutting protocol to the decoding tree of a real-valued FSD algorithm. The new Real-valued Fixed-Complexity Sphere Decoder (RFSD) algorithm derived achieves similar quasi-ML decoding performance as FSD, but with an average 70% reduction in computational complexity, as we demonstrate from both theoretical and implementation perspectives for Quadrature Amplitude Modulation (QAM)-MIMO systems.
Original languageEnglish
Article number5872079
Pages (from-to)4493-4499
Number of pages7
JournalIEEE Transactions on Signal Processing
Issue number9
Publication statusPublished - Sept 2011

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing


Dive into the research topics of 'Real-valued fixed-complexity sphere decoder for high dimensional QAM-MIMO systems'. Together they form a unique fingerprint.

Cite this