Computer Science – Information Theory
Scientific paper
2010-11-06
Computer Science
Information Theory
Submitted to AAECC
Scientific paper
In this work we introduce and study a set of new interleavers based on permutation functions with known inverses over a finite field $\mathbb{F}_q$ for using in turbo code structures. For the first time, Dickson, M\"{o}bius and R\'edei functions are used to give new deterministic interleavers. In addition we employ Skolem sequences in order to find new interleavers with known cycle structure. We give an exact formula for the inverse of every R\'edei function. The cycle structure of R\'edei functions is also investigated. Moreover, self-inverse and non-self-inverse versions of permutation functions are used to construct interleavers. The advantage of self-inverse interleavers is that they are their own deinterleavers and are useful for turbo decoding. Finally, we carry out experiments, and we report on the performance of these interleavers.
Eshghi Nasim
Panario Daniel
Sadeghi Mohammad-Reza
Sakzad Amin
No associations
LandOfFree
Deterministic Interleavers for Turbo Codes Based on Permutation Functions with Given Cycle Structure 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 Deterministic Interleavers for Turbo Codes Based on Permutation Functions with Given Cycle Structure, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deterministic Interleavers for Turbo Codes Based on Permutation Functions with Given Cycle Structure will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-699512