Iterative interleaver growth algorithms of polynomial complexityfor turbo codes

摘要

In this paper the design of interleavers for parallel concatenatedconvolutional codes (PC-CCs) optimized for specific constituent codes isaddressed. The design procedure is based on the interpretation of theinterleaving function as a permutation decomposed into a sequence oftwo-element transpositions. The desired interleavers are grown by addingone new transposition at a time, selected on the basis of a costfunction with optimal asymptotic behavior