Parallel access by butterfly networks for any degree permutation polynomial and ARP interleavers

DOI10.1016/j.jfranklin.2018.12.018zbMath1464.94082OpenAlexW2912201830MaRDI QIDQ1738592

Daniela Tarniceriu, Lucian Trifina

Publication date: 18 April 2019

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jfranklin.2018.12.018

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Decoding (94B35)

Uses Software

• LDPC

Cites Work

• A Mathematical Theory of Communication
• Polynomial functions (mod m)
• Über Permutationspolynome und Permutationsfunktionen für Primzahlpotenzen
• Interleavers for turbo codes using permutation polynomials over integer rings
• On maximum contention-free interleavers and permutation polynomials over integer rings
• Mapping Interleaving Laws to Parallel Turbo and LDPC Decoder Architectures
• Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective
• A Note on Permutation Polynomials Over $\BBZ _{n}$
• Access and Alignment of Data in an Array Processor
• On quadratic permutation polynomials, turbo codes, and butterfly networks
• Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
• Design of QPP Interleavers for the Parallel Turbo Decoding Architecture
• On the Minimum Distance of Turbo Codes With Quadratic Permutation Polynomial Interleavers
• A Contention-Free Parallel Access by Butterfly Networks for Turbo Interleavers
• Permutation polynomials modulo \(2^w\)

This page was built for publication: Parallel access by butterfly networks for any degree permutation polynomial and ARP interleavers