Memory Power Reduction for High-Speed Implementation of Turbo Codes

  • Authors:
  • B. Bougard;L. Van Der Perre;F. Maessen;A. Giulietti;V. Derudder;F. Catthoor

  • Affiliations:
  • IMEC, Leuven, Belgium;IMEC, Leuven, Belgium;IMEC, Leuven, Belgium;IMEC, Leuven, Belgium;IMEC, Leuven, Belgium;IMEC, Leuven, Belgium

  • Venue:
  • Journal of VLSI Signal Processing Systems
  • Year:
  • 2003

Quantified Score

Hi-index 0.01

Visualization

Abstract

Turbo codes achieve one of the highest coding gains known and should be the best candidates for error correction in high-speed communication systems. However, the standard implementation of their decoding algorithm suffers from a large latency and high power consumption making them improper for mobile interactive systems. To overcome this drawback, we carefully analyzed the Maximum A Posteriori algorithm, the key-building block of the decoder, and stated that memory accesses are the bottleneck. Therefore, we have systematically optimized the data transfer and storage. This paper presents the main results of this optimization, especially those concerning the memory organization and architecture.Both for the input and the metrics values, a memory sub-layer is introduced such that temporal data locality can be maximally exploited. The architecture is defined to optimally allocate memory units and assign arrays, such that the number of accesses is drastically reduced. The combined optimizations reduce the latency by a factor 600 and the energy per bit by a factor 20, breaking definitely an important obstruction to the application of turbo codes in high-speed communication systems.