Study on Interleaver Design for Turbo Codes Using Permutation Polynomials Over Integer Rings

Download PDF
Open Webpage

Le Zhang, Youyun Xu, Xinrui Ma, Hanwen Luo, Xiaoying Gan

Published: 2006, Last Modified: 21 Jan 2026VTC Fall 2006EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Some properties of permutation polynomials over integer rings, mainly the 3n case, are studied and some conclusions are drawn. A decision theorem for 3n case and a proof of the MCF property for size pn permutation polynomial-based interleaver are presented. A design criterion for interleavers based on third degree permutation polynomial is proposed to select the coefficients of the polynomials. Simulation results show that these interleavers can achieve near performance of S-random interleavers, and for short frame size, they outperform S-random interleavers.