A code-matched interleaver design based on the parity-check weight low-bound of component codes for turbo codes

Considering the Interleaver optimization of short frame turbo codes, a code-matched interleaver design based on the parity weight low-bound of component codes is proposed. The form of Locally-bad in turbo codes is investigated. To improve the bit-error property of short frame turbo codes, an algorithm for estimating the low-bound of recursive systematic convolutional code (RSC) parity weight is proposed. This algorithm for estimating the parity-check weight low-bound of component codes is adopted to select the excellent mapping way. Only the mapping ways that can promise the codewords weight of all the Locally-bad in turbo codes will be selected. Compared with the several existing interleaver design, Simulation results show that the proposed code-matched interleaver design is more excellent. The code-matched interleaver design algorithm proposed in this article can improve the bit-error property of short frame turbo codes obviously.