Efficient Address Generation for Permutation Polynomial Based Interleavers over Integer Rings
Jonghoon Ryu · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2012
Permutation polynomial based interleavers over integer rings have recently received attention for their excellent channel coding performance, elegant algebraic properties and simplicity of implementation. In this letter, it is shown that permutation polynomial based interleavers of practical interest is decomposed into linear permutation polynomials. Based on this observation, it is shown that permutation polynomial based interleavers as well as their inverses can be efficiently implemented.