Finite Wordlength Analysis and Adaptive Decoding for Turbo/MAP Decoders

Zhongfeng Wang, Hiroshi Suzuki, Keshab K. Parhi

Research output: Contribution to journalArticle

7 Scopus citations

Abstract

Turbo decoders inherently require large hardware for VLSI implementation as a large amount of memory is required to store incoming data and intermediate computation results. Design of highly efficient Turbo decoders requires reduction of hardware size and power consumption. In this paper, finite precision effects on the performance of Turbo decoders are analyzed and the optimal word lengths of variables are determined considering tradeoffs between the performance and the hardware cost. It is shown that the performance degradation from the infinite precision is negligible if 4 bits are used for received bits and 6 bits for the extrinsic information. The state metrics normalization method suitable for Turbo decoders is also discussed. This method requires small amount of hardware and its speed does not depend on the number of states. Furthermore, we propose a novel adaptive decoding approach which does not lead to performance degradation and is suitable for VLSI implementation.

Original languageEnglish (US)
Pages (from-to)209-221
Number of pages13
JournalJournal of VLSI Signal Processing Systems for Signal, Image, and Video Technology
Volume29
Issue number3
DOIs
StatePublished - Dec 1 2001

    Fingerprint

Keywords

  • Adaptive decoding
  • MAP algorithm
  • Turbo codes
  • VLSI implementation

Cite this