Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hongyu Zhao ; Provincial Key Lab. of Inf. Coding & Transm., Southwest Jiaotong Univ., Chengdu, China ; Pingzhi Fan ; Tarokh, Vahid

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.

Published in:

Communications Letters, IEEE  (Volume:14 ,  Issue: 3 )