Exploring general memory structures in turbo decoders using sliding-window MAP algorithm

Chien Ming Wu, Ming Der Shieh, Chien Hsing Wu

Research output: Contribution to journalArticlepeer-review

Abstract

Turbo coding is a powerful coding technique that can provide highly reliable data transmission at extremely low signal-to-noise ratios. Owing to the computational complexity of the employed decoding algorithm, the realization of turbo decoders usually takes a large amount of memory space and potentially long decoding delay. Therefore, an efficient memory management strategy becomes one of the key factors toward successfully implementing turbo decoders. This paper focuses on the development of general structures for efficient memory management of turbo decoders employing the sliding-window (Log-)MAP algorithm. Three different structures and the associated mathematic representations are derived to evaluate the required memory size, average decoding rate, and latency based on the speed and the number of the adopted processors. Comparative results show the dependency of the resulting performance based on a set of parameters; thus provide useful and general information on practical implementations of turbo decoders.

Original languageEnglish
Pages (from-to)3163-3173
Number of pages11
JournalIEICE Transactions on Communications
VolumeE86-B
Issue number11
Publication statusPublished - 2003 Nov

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Exploring general memory structures in turbo decoders using sliding-window MAP algorithm'. Together they form a unique fingerprint.

Cite this