A best-first soft/hard decision tree searching MIMO decoder for a 4 × 4 64-QAM system

Chungan Shen, Ahmed M. Eltawil, Khaled N. Salama, Sudip Mondal

Research output: Contribution to journalArticlepeer-review

25 Scopus citations


This paper presents the algorithm and VLSI architecture of a configurable tree-searching approach that combines the features of classical depth-first and breadth-first methods. Based on this approach, techniques to reduce complexity while providing both hard and soft outputs decoding are presented. Furthermore, a single programmable parameter allows the user to tradeoff throughput versus BER performance. The proposed multiple-input-multiple-output decoder supports a 4 × 4 64-QAM system and was synthesized with 65-nm CMOS technology at 333 MHz clock frequency. For the hard output scheme the design can achieve an average throughput of 257.8 Mbps at 24 dB signal-to-noise ratio (SNR) with area equivalent to 54.2 Kgates and a power consumption of 7.26 mW. For the soft output scheme it achieves an average throughput of 83.3 Mbps across the SNR range of interest with an area equivalent to 64 Kgates and a power consumption of 11.5 mW. © 2011 IEEE.
Original languageEnglish (US)
Pages (from-to)1537-1541
Number of pages5
JournalIEEE Transactions on Very Large Scale Integration (VLSI) Systems
Issue number8
StatePublished - Aug 2012

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: Manuscript received September 17, 2010; revised January 13, 2011 and April 14, 2011; accepted May 22, 2011. Date of publication July 18, 2011; date of current version June 14, 2012. This work was supported in part by the Department of Justice, National Institute of Justice DOJ/NIJ under grant 2006-IJ-CX-K044.

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software
  • Electrical and Electronic Engineering


Dive into the research topics of 'A best-first soft/hard decision tree searching MIMO decoder for a 4 × 4 64-QAM system'. Together they form a unique fingerprint.

Cite this