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.
(Publisher abstract provided.)
Downloads
Similar Publications
- Training police for procedural justice: An evaluation of officer attitudes, citizen attitudes, and police-citizen interactions
- Criminal Justice Interventions for Offenders With Mental Illness: Evaluation of Mental Health Courts in Bronx and Brooklyn, New York, Executive Summary
- Toward a Developmental Model of Continuity and Change in PTSD Symptoms following Exposure to Traumatic and Adverse Experiences