Hybrid concatenated codes and iterative decoding

Author

Divsalar, Dariush ; Pollara, Fabrizio

Author_Institution

Jet Propulsion Lab., California Inst. of Technol., Pasadena, CA, USA

fYear

1997

fDate

29 Jun-4 Jul 1997

Firstpage

10

Abstract

A hybrid concatenated code is a combination of parallel and serial concatenated codes. Here we consider an example with three codes and two interleavers. An upper bound to the bit error rate (BER) of the hybrid code is obtained. Design rules for the three component codes that maximize the interleavers gain and the asymptotic slope of the BER curves are discussed. A low-complexity iterative decoding algorithm with near maximum-likelihood performance is proposed. Comparisons with “turbo codes” and with serially concatenated codes show that the hybrid scheme offers better performance at very low BER

Keywords

concatenated codes; convolutional codes; interleaved codes; iterative methods; maximum likelihood decoding; BER curves; asymptotic slope; bit error rate; design rules; hybrid concatenated codes; interleavers gain; low-complexity iterative decoding algorithm; near maximum-likelihood performance; parallel concatenated codes; performance; serial concatenated codes; three component codes; turbo codes; upper bound; Bit error rate; Concatenated codes; Electronic mail; Hydrogen; Iterative decoding; Laboratories; Performance gain; Propulsion; Signal to noise ratio; Space technology;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on

Conference_Location

Ulm

Print_ISBN

0-7803-3956-8

Type

conf

DOI

10.1109/ISIT.1997.612925

Filename

612925