Memory arrangements in turbo decoders using sliding-window BCJR algorithm

Chien Ming Wu, Ming-Der Shieh, Chien Hsing Wu

Research output: Contribution to journalConference articlepeer-review

4 Citations (Scopus)

Abstract

Turbo coding is a powerful encoding and decoding technique that can provide highly reliable data transmission at extremely low signal-to-noise ratios. According to the computational complexity of the employed decoding algorithm, the realization of turbo decoders usually takes a large amount of memory spaces and potentially long decoding delay. Therefore, an efficient memory management strategy becomes one of the key factors toward successfully designing turbo decoders. This paper focuses on the development of general formulas for efficient memory management of turbo decoders employing the sliding-window BCJR algorithm. Three simple but general results are presented to evaluate the required memory size, throughput rate, and latency based on the speed and the number of adopted processors. The results thus provide useful and general information on practical implementations of turbo decoders.

Original languageEnglish
JournalProceedings - IEEE International Symposium on Circuits and Systems
Volume5
Publication statusPublished - 2002 Jan 1
Event2002 IEEE International Symposium on Circuits and Systems - Phoenix, AZ, United States
Duration: 2002 May 262002 May 29

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Memory arrangements in turbo decoders using sliding-window BCJR algorithm'. Together they form a unique fingerprint.

Cite this