A new memory-reduced architecture design for log-MAP algorithm in turbo decoding

Tsung Han Tsai, Cheng Hung Lin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In coding theory, turbo codes have been the breakthrough in recent years. Among these, the MAP (maximum a posteriori) algorithm is a powerful SISO (soft-input soft-output) algorithm for turbo decoding. However, MAP decoders of the turbo decoding consume large memories in hardware implementation. This paper presents a new architecture for memory reduction in log-MAP (logarithm-MAP) algorithm. Based on the scheduling analysis, the backward recursion can be reversed in order to be directly operated on with forward recursion. The comparison result shows it can effectively reduce the memory size up to half size of the previous works. In addition, we also simplify the memory data access without extra address generators.

Original languageEnglish
Title of host publicationProceedings of the IEEE 6th Circuits and Systems Symposium on Emerging Technologies
Subtitle of host publicationFrontiers of Mobile and Wireless Communication
Pages607-610
Number of pages4
StatePublished - 2004
EventProceedings of the IEEE 6th Circuits and Systems Symposium on Emerging Technologies: Frontiers of Mobile and Wireless Communication - Shanghai, China
Duration: 31 May 20042 Jun 2004

Publication series

NameProceedings of the IEEE 6th Circuits and Systems Symposium on Emerging Technologies: Frontiers of Mobile and Wireless Communication
Volume2

Conference

ConferenceProceedings of the IEEE 6th Circuits and Systems Symposium on Emerging Technologies: Frontiers of Mobile and Wireless Communication
Country/TerritoryChina
CityShanghai
Period31/05/042/06/04

Fingerprint

Dive into the research topics of 'A new memory-reduced architecture design for log-MAP algorithm in turbo decoding'. Together they form a unique fingerprint.

Cite this