Title :
A very low complexity block turbo decoder composed of extended Hamming codes
Author :
Chen, Yanni ; Parhi, Keshab K.
Author_Institution :
Dept. of Electr. & Comput. Eng., Minnesota Univ., Minneapolis, MN, USA
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 an AWGN channel using BPSK modulation are considered. Extra 0.3 dB to 0.4 dB coding gain is obtained if compared with the scheme proposed in Pyndiah et al., (1996), 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.5 dB. Other schemes such as reduction of test patterns in the Chase algorithm and memory saving techniques are also presented
Keywords :
AWGN channels; Hamming codes; block codes; computational complexity; iterative decoding; phase shift keying; turbo codes; AWGN channel; BPSK modulation; Chase algorithm; block turbo decoder; complexity reduction; extended Hamming codes; iterative decoding; low complexity decoder; memory saving techniques; performance evaluation; soft inputs updating algorithm; test pattern reduction; AWGN channels; Binary phase shift keying; Degradation; Euclidean distance; Hardware; Iterative algorithms; Iterative decoding; Modulation coding; Testing; Turbo codes;
Conference_Titel :
Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE
Conference_Location :
San Antonio, TX
Print_ISBN :
0-7803-7206-9
DOI :
10.1109/GLOCOM.2001.965101
