Distance spectrum of the turbo-codes

Author

Podemski, R. ; Holubowicz, W. ; Berrou, C. ; Glavieux, A.

Author_Institution

Franco-Polish Sch. of New Inf. & Commun. Technol., Poznan, Poland

fYear

1995

fDate

17-22 Sep 1995

Firstpage

34

Abstract

An analytical approach to newly invented turbo codes (TC) is presented. That approach is based on evaluating the properties of TC by means of the minimum Hamming distance (MHD) and the Hamming distance spectrum (HDS). An algorithm for computing HDS is presented and numerical results are discussed. The concept of basic return-to-zero sequence is introduced. It is shown how basic return-to-zero sequences can be used in the algorithm for computing HDS and how it can justify the properties of TC. Numerical results of computing MHD and HDS for different TCs are presented and verified by simulations

Keywords

binary sequences; concatenated codes; interleaved codes; spectral analysis; Hamming distance spectrum; algorithm; interleaver; minimum Hamming distance; numerical results; return to zero sequences; simulations; turbo codes; Binary sequences; Circuits; Communications technology; Computational modeling; Convolutional codes; Decoding; Hamming distance; Information analysis; Magnetohydrodynamics; Turbo codes;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Whistler, BC

Print_ISBN

0-7803-2453-6

Type

conf

DOI

10.1109/ISIT.1995.531136

Filename

531136