A simple method to determine the number of true different quadratic and cubic permutation polynomial based interleavers for turbo codes

Abstract

Interleavers are important blocks of the turbo codes, their types and dimensions having a significant influence on the performances of the mentioned codes. If appropriately chosen, the permutation polynomial (PP) based interleavers lead to remarkable performances of these codes. The most used interleavers from this category are quadratic permutation polynomial (QPP) and cubic permutation polynomial (CPP) based ones. In this paper, we determine the number of different QPPs and CPPs that cannot be reduced to linear permutation polynomials (LPPs) or to QPPs or LPPs, respectively. They are named true QPPs and true CPPs, respectively. Our analysis is based on the necessary and sufficient conditions for the coefficients of second and third degree polynomials to be QPPs and CPPs, respectively, and on the Chinese remainder theorem. This is of particular interest when we need to find QPP or CPP based interleavers for turbo codes.