Title :
Iterative interleaver growth algorithms of polynomial complexity for turbo codes
Author :
Daneshgaran, Fred ; Mondin, Marina
Author_Institution :
Dept. of Electr. & Comput. Eng., California State Univ., Los Angeles, CA, USA
Abstract :
In this paper the design of interleavers for parallel concatenated convolutional codes (PC-CCs) optimized for specific constituent codes is addressed. The design procedure is based on the interpretation of the interleaving function as a permutation decomposed into a sequence of two-element transpositions. The desired interleavers are grown by adding one new transposition at a time, selected on the basis of a cost function with optimal asymptotic behavior
Keywords :
computational complexity; interleaved codes; iterative methods; optimisation; polynomials; turbo codes; cost function; design; iterative interleaver growth algorithms; optimal asymptotic behavior; optimization; parallel concatenated convolutional codes; permutation; polynomial complexity; specific constituent codes; turbo codes; two-element transpositions; Algorithm design and analysis; Carbon capture and storage; Concatenated codes; Convolutional codes; Cost function; Delay; Design optimization; Interleaved codes; Iterative algorithms; Turbo codes;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.709023
