Improved QPP Interleavers for LTE Standard
Lucian Trifina, Daniela T\u{a}rniceriu, Valeriu Munteanu

TL;DR
This paper introduces a theorem for quadratic permutation polynomials to optimize LTE interleavers, reducing search time and improving performance with up to 0.5 dB coding gains.
Contribution
It provides a new theorem for identifying identical permutations, enabling faster search and better interleaver designs for LTE standards.
Findings
Reduced search time for LTE QPP interleavers
Identified polynomials with improved distance spectrum
Achieved up to 0.5 dB coding gains
Abstract
This paper proposes and proves a theorem which stipulates sufficient conditions the coefficients of two quadratic permutation polynomials (QPP) must satisfy, so that the permutations generated by them are identical. The result is used to reduce the search time of QPP interleavers with lengths given by Long Term Evolution (LTE) standard up to 512, by improving the distance spectrum over the set of polynomials with the largest spreading factor. Polynomials that lead to better performance compared to LTE standard are found for several lengths. Simulations show that 0.5 dB coding gains can be obtained compared to LTE standard.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
