A very low complexity block turbo decoder composed of extended Hamming codes

Yanni Chen, Keshab K. Parhi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

This paper presents a very low complexity block turbo decoder composed of extended Hamming codes. New efficient complexity reduction algorithms are proposed including simplifying the extrinsic information computation and soft inputs updating algorithm. For performance evaluation, [eHamming(32, 26, 4)]2 and [eHamming(64, 57, 4)]2 block turbo code transmitted over AWGN channel using BPSK modulation are considered. Extra 0.3dB to 0.4dB coding gain is obtained if compared with the scheme proposed in [5] and the hardware overhead is negligible. The complexity of our new block turbo decoder is about ten times less than that of the near-optimum block turbo decoder with a performance degradation of only 0.5dB. Other schemes such as reduction of test patterns in the Chase algorithm and memory saving techniques are also presented.

Original languageEnglish (US)
Title of host publicationConference Record / IEEE Global Telecommunications Conference
Pages171-175
Number of pages5
Volume1
StatePublished - Dec 1 2001
EventIEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States
Duration: Nov 25 2001Nov 29 2001

Other

OtherIEEE Global Telecommunicatins Conference GLOBECOM'01
CountryUnited States
CitySan Antonio, TX
Period11/25/0111/29/01

Fingerprint Dive into the research topics of 'A very low complexity block turbo decoder composed of extended Hamming codes'. Together they form a unique fingerprint.

Cite this