Interleavers for turbo codes using permutation polynomials over integer rings

Authors:
J. Sun;O. Y. Takeshita
Affiliations:
Electr. & Comput. Eng. Dept., Ohio State Univ., Columbus, OH, USA;-
Venue:
IEEE Transactions on Information Theory
Year:
2005

Citing 0
Cited 19

Dynamic reconfiguration approach for high speed turbo decoding using circular rings

Proceedings of the 19th ACM Great Lakes symposium on VLSI
Collision free row column S-random interleaver

IEEE Communications Letters
Rate variable, multi-binary turbo codes with controlled error-floor

IEEE Transactions on Communications
Cyclotomic mapping permutation polynomials over finite fields

SSC'07 Proceedings of the 2007 international conference on Sequences, subsequences, and consequences
Structure, property, and design of nonbinary regular cycle codes

IEEE Transactions on Communications
On the equivalence of interleavers for turbo codes using quadratic permutation polynomials over integer rings

IEEE Communications Letters
On the performance of serially concatenated convolutional code for frequency hopped PSK in partial-band noise jammer

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
The manifestation of stopping sets and absorbing sets as deviations on the computation trees of LDPC codes

Journal of Electrical and Computer Engineering - Special issue on iterative signal processing in communications
A Flexible LDPC/Turbo Decoder Architecture

Journal of Signal Processing Systems
Implementation of a High Throughput 3GPP Turbo Decoder on GPU

Journal of Signal Processing Systems
Ambiguity and deficiency in costas arrays and APN permutations

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Four classes of permutation polynomials of F2m

Finite Fields and Their Applications
More explicit classes of permutation polynomials of F33m

Finite Fields and Their Applications
On permutation polynomials of prescribed shape

Finite Fields and Their Applications
Prunable Collision Free Random Interleaver Design

Wireless Personal Communications: An International Journal
Analysis of Cubic Permutation Polynomials for Turbo Codes

Wireless Personal Communications: An International Journal
A Fast Recursive Algorithm and Architecture for Pruned Bit-reversal Interleavers

Journal of Signal Processing Systems
Note: Permutation polynomials and their differential properties over residue class rings

Discrete Applied Mathematics
The Carlitz rank of permutations of finite fields: A survey

Journal of Symbolic Computation

Quantified Score

Hi-index	754.84

Visualization

Abstract

A class of deterministic interleavers for turbo codes (TCs) based on permutation polynomials over ZN is introduced. The main characteristic of this class of interleavers is that they can be algebraically designed to fit a given component code. Moreover, since the interleaver can be generated by a few simple computations, storage of the interleaver tables can be avoided. By using the permutation polynomial-based interleavers, the design of the interleavers reduces to the selection of the coefficients of the polynomials. It is observed that the performance of the TCs using these permutation polynomial-based interleavers is usually dominated by a subset of input weight 2m error events. The minimum distance and its multiplicity (or the first few spectrum lines) of this subset are used as design criterion to select good permutation polynomials. A simple method to enumerate these error events for small m is presented. Searches for good interleavers are performed. The decoding performance of these interleavers is close to S-random interleavers for long frame sizes. For short frame sizes, the new interleavers outperform S-random interleavers.