Abstract
It is known that the equivalence of interleavers for turbo codes using quadratic permutation polynomials (QPPs) over integer rings can be exactly determined by the so-called quadratic null polynomials (QNPs) over integer rings. For generating QNPs or higher order null polynomials (NPs), some theoretical results have been obtained in previous literature. In this letter, it is proved that the coefficients of previously obtained QNPs are not only sufficient but also necessary for generating any QNPs. Based on the necessary and sufficient conditions for generating QNPs and QPPs, the enumeration of QPPs excluding their equivalence is presented. The obtained results are helpful to investigate the algebraic structure of QPP interleavers as well as to avoid the equivalence in the design of QPP interleavers.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
