Efficient Address Generation for Permutation Polynomial Based Interleavers over Integer Rings

Jonghoon RYU

doi:10.1587/transfun.E95.A.421

Efficient Address Generation for Permutation Polynomial Based Interleavers over Integer Rings

Jonghoon RYU

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E95-A No.1 pp.421-424

Publication Date: 2012/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E95.A.421

Type of Manuscript: LETTER

Category: Coding Theory

Cite this

Copy

Jonghoon RYU, "Efficient Address Generation for Permutation Polynomial Based Interleavers over Integer Rings" in IEICE TRANSACTIONS on Fundamentals, vol. E95-A, no. 1, pp. 421-424, January 2012, doi: 10.1587/transfun.E95.A.421.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E95.A.421/_p

Copy

@ARTICLE{e95-a_1_421,
author={Jonghoon RYU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Address Generation for Permutation Polynomial Based Interleavers over Integer Rings},
year={2012},
volume={E95-A},
number={1},
pages={421-424},
abstract={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.},
keywords={},
doi={10.1587/transfun.E95.A.421},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - Efficient Address Generation for Permutation Polynomial Based Interleavers over Integer Rings
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 421
EP - 424
AU - Jonghoon RYU
PY - 2012
DO - 10.1587/transfun.E95.A.421
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E95-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2012
AB - 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.
ER -