Computer Science – Information Theory
Scientific paper
2011-06-10
Computer Science
Information Theory
accepted for publication to Wireless Personal Communications (19 pages, 4 figures, 5 tables). The final publication is availab
Scientific paper
Quadratic permutation polynomials (QPPs) have been widely studied and used as interleavers in turbo codes. However, less attention has been given to cubic permutation polynomials (CPPs). This paper proves a theorem which states sufficient and necessary conditions for a cubic permutation polynomial to be a null permutation polynomial. The result is used to reduce the search complexity of CPP interleavers for short lengths (multiples of 8, between 40 and 352), by improving the distance spectrum over the set of polynomials with the largest spreading factor. The comparison with QPP interleavers is made in terms of search complexity and upper bounds of the bit error rate (BER) and frame error rate (FER) for AWGN and for independent fading Rayleigh channels. Cubic permutation polynomials leading to better performance than quadratic permutation polynomials are found for some lengths.
Tărniceriu Daniela
Trifina Lucian
No associations
LandOfFree
Analysis of cubic permutation polynomials for turbo codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Analysis of cubic permutation polynomials for turbo codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis of cubic permutation polynomials for turbo codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-319810