DocumentCode :
2077648
Title :
A very low complexity block turbo decoder for product codes
Author :
Pyndiah, Ramesh ; Combelles, Pierre ; Adde, Patrick
Author_Institution :
Telecom Bretagne, Brest, France
Volume :
1
fYear :
1996
fDate :
18-22 Nov 1996
Firstpage :
101
Abstract :
This paper presents a low complexity block turbo decoder for product codes. This new decoder, which has been derived from the near-optimum block turbo decoder is a very good compromise between complexity and performance. For performance evaluation, we have considered the [BCH(64,57,4)]2 product code transmitted over a Gaussian channel using a QPSK modulation. The complexity of the new block turbo decoder is about ten times less than that of the near-optimum block turbo decoder for a coding gain degradation of only 0.7 dB
Keywords :
BCH codes; Gaussian channels; block codes; computational complexity; concatenated codes; decoding; quadrature phase shift keying; BCH code; Gaussian channel; QPSK modulation; coding gain degradation; concatenated coding; near-optimum block turbo decoder; performance evaluation; product codes; turbo codes; very low complexity block turbo decoder; Block codes; Concatenated codes; Convolutional codes; Error correction codes; Iterative decoding; Maximum likelihood decoding; Modulation coding; Product codes; Reed-Solomon codes; Viterbi algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 1996. GLOBECOM '96. 'Communications: The Key to Global Prosperity
Conference_Location :
London
Print_ISBN :
0-7803-3336-5
Type :
conf
DOI :
10.1109/GLOCOM.1996.594341
Filename :
594341
Link To Document :
بازگشت