NDLI: Fast Pruned Interleaving

Content Provider	IEEE Xplore Digital Library
Author	Mansour, Mohammad M.
Copyright Year	1972
Abstract	\boldmath In this paper, computationally efficient schemes for enumerating the so-called inliers of a wide range of permutations employed in pruned variable-size (turbo) interleavers are proposed. The objective is to accelerate pruned interleaving time in turbo codes by computing a statistic known as the pruning gap that enables determining a permuted address under pruning without serially permuting all its predecessors. It is shown that for any linear or quadratic permutation, including variations such as dithered relative prime or almost regular, the pruning gap can be computed in logarithmic time. Moreover, it is shown that Dedekind sums form efficient building blocks for enumerating inliers of the widely adopted polynomial-based permutations. An efficient algorithm for computing such sums in vector form using integer operations is presented. The results are extended to 2D and higher dimensional interleavers that combine multiple permutations along all dimensions, and closed-form expressions for inliers are derived. It is shown that the inliers statistic is a linear combination of the constituent permutation inliers. A lower bound on the minimum spread of serially pruned interleavers using the inliers statistic is also derived. Moreover, it is shown that serially pruned interleavers inherit the content-free property of the mother interleaver, and hence they are parallelizable. Simulation results of practical pruned turbo interleavers demonstrate a speedup improvement of several orders of magnitude compared to serial interleaving.
Starting Page	817
Ending Page	831
Page Count	15
File Size	500270
File Format	PDF
ISSN	00906778
Volume Number	61
Issue Number	3
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-03-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Vectors Polynomials Turbo codes Acceleration Closed-form solutions Simulation Indexes channel interleavers Pruned interleavers turbo codes permutation polynomials QPPs 3GPP LTE
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On the Minimum Distance of Turbo Codes With Quadratic Permutation Polynomial Interleavers

Pruned Bit-Reversal Permutations: Mathematical Characterization, Fast Algorithms and Architectures

Parallel lookahead algorithms for pruned interleavers

Quadratic Permutation Polynomial Interleavers for 3gpp Lte Turbo Codes

On the contention-free and spread characteristics of serially-pruned interleavers

Reconfigurable Turbo Decoder With Parallel Architecture for 3GPP LTE System

A Parallel Pruned Bit-Reversal Interleaver

On the equivalence of interleavers for turbo codes using quadratic permutation polynomials over integer rings

Variable Parallelism Cyclic Redundancy Check Circuit for 3GPP-LTE/LTE-Advanced

Fast Pruned Interleaving

Similar Documents

On the Minimum Distance of Turbo Codes With Quadratic Permutation Polynomial Interleavers

Pruned Bit-Reversal Permutations: Mathematical Characterization, Fast Algorithms and Architectures

Parallel lookahead algorithms for pruned interleavers

Quadratic Permutation Polynomial Interleavers for 3gpp Lte Turbo Codes

On the contention-free and spread characteristics of serially-pruned interleavers

Reconfigurable Turbo Decoder With Parallel Architecture for 3GPP LTE System

A Parallel Pruned Bit-Reversal Interleaver

On the equivalence of interleavers for turbo codes using quadratic permutation polynomials over integer rings

Variable Parallelism Cyclic Redundancy Check Circuit for 3GPP-LTE/LTE-Advanced

Fast Pruned Interleaving