Reduced memory decoding schemes for turbo decoding based on storing the index of the state metric

Ming Zhan, Jun Wu, Hong Wen*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


In the implementation of turbo-like decoder, the size of state metrics cache (SMC) has a predominant impact on the core area and the overall power dissipation. Different from previous reported decoding schemes, in the proposed decoding schemes, a compressing module and a regeneration module are added to the decoder. The compressing module sorts the forward state metrics from the minimum to the maximum, by which an index sequence and the corresponding increase metrics are calculated, and subsequently are stored in the SMC. In the regeneration module, the forward state metrics are estimated with the index sequence and the increase metrics that accessed from the SMC. With the cost of dummy calculation that is performed by the compressing and the regeneration modules, two decoding schemes are proposed. For an eight-state turbo codes, the linear and the nonlinear estimation based decoding schemes reduce the SMC size by 62.5% and 57.5%, respectively. The bit error rate (BER) simulation is performed for both binary turbo code and duo binary convolutional turbo code, and shows BER of the linear estimation-based scheme is superior to that of the enhanced max-log-MAP (the maximum a posteriori probability) algorithm, whereas BER of the non-linear estimation-based decoding scheme is very close to that of the near optimal decoding scheme.

Original languageEnglish
Pages (from-to)2095-2105
Number of pages11
JournalIET Communications
Issue number12
Publication statusPublished - 2014
Externally publishedYes

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Reduced memory decoding schemes for turbo decoding based on storing the index of the state metric'. Together they form a unique fingerprint.

Cite this