The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Cette lettre présente une architecture de transformée de Fourier en champ de Galois à facteurs premiers (PF-GFFT) pour le décodage dans le domaine fréquentiel (FDD) des codes cycliques. Premièrement, un schéma FDD rapide est conçu pour convertir la transformée de Fourier unique plus longue d'origine en une transformation multidimensionnelle plus petite. De plus, une architecture de décalage pour PF-GFFT est explorée pour résoudre le problème de réarrangement des données d'entrée et de sortie. À cet égard, PF-GFFT est considéré comme un schéma de calcul spectral d’ordre inférieur, qui présente une prépondérance suffisante pour réduire la complexité de calcul. Les résultats de simulation montrent que PF-GFFT se compare favorablement aux algorithmes généraux actuels GFFT, GFFT simplifié (S-GFFT) et GFFT à déplacements circulaires (CS-GFFT) en termes de coût, et représente presque un ordre de grandeur ou moins. qu'eux. Cette supériorité constitue un avantage pour améliorer la vitesse de décodage et présente une valeur d'application potentielle dans le décodage de codes cycliques comportant des longueurs de code plus longues.
Yanyan CHANG
Tianjin University
Wei ZHANG
Tianjin University
Hao WANG
China Aerospace Science and Technology Corporation
Lina SHI
Tianjin University
Yanyan LIU
Nankai University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Yanyan CHANG, Wei ZHANG, Hao WANG, Lina SHI, Yanyan LIU, "Prime-Factor GFFT Architecture for Fast Frequency Domain Decoding of Cyclic Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E107-A, no. 1, pp. 174-177, January 2024, doi: 10.1587/transfun.2023EAL2044.
Abstract: This letter introduces a prime-factor Galois field Fourier transform (PF-GFFT) architecture to frequency domain decoding (FDD) of cyclic codes. Firstly, a fast FDD scheme is designed which converts the original single longer Fourier transform to a multi-dimensional smaller transform. Furthermore, a ladder-shift architecture for PF-GFFT is explored to solve the rearrangement problem of input and output data. In this regard, PF-GFFT is considered as a lower order spectral calculation scheme, which has sufficient preponderance in reducing the computational complexity. Simulation results show that PF-GFFT compares favorably with the current general GFFT, simplified-GFFT (S-GFFT), and circular shifts-GFFT (CS-GFFT) algorithms in time-consuming cost, and is nearly an order of magnitude or smaller than them. The superiority is a benefit to improving the decoding speed and has potential application value in decoding cyclic codes with longer code lengths.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2023EAL2044/_p
Copier
@ARTICLE{e107-a_1_174,
author={Yanyan CHANG, Wei ZHANG, Hao WANG, Lina SHI, Yanyan LIU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Prime-Factor GFFT Architecture for Fast Frequency Domain Decoding of Cyclic Codes},
year={2024},
volume={E107-A},
number={1},
pages={174-177},
abstract={This letter introduces a prime-factor Galois field Fourier transform (PF-GFFT) architecture to frequency domain decoding (FDD) of cyclic codes. Firstly, a fast FDD scheme is designed which converts the original single longer Fourier transform to a multi-dimensional smaller transform. Furthermore, a ladder-shift architecture for PF-GFFT is explored to solve the rearrangement problem of input and output data. In this regard, PF-GFFT is considered as a lower order spectral calculation scheme, which has sufficient preponderance in reducing the computational complexity. Simulation results show that PF-GFFT compares favorably with the current general GFFT, simplified-GFFT (S-GFFT), and circular shifts-GFFT (CS-GFFT) algorithms in time-consuming cost, and is nearly an order of magnitude or smaller than them. The superiority is a benefit to improving the decoding speed and has potential application value in decoding cyclic codes with longer code lengths.},
keywords={},
doi={10.1587/transfun.2023EAL2044},
ISSN={1745-1337},
month={January},}
Copier
TY - JOUR
TI - Prime-Factor GFFT Architecture for Fast Frequency Domain Decoding of Cyclic Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 174
EP - 177
AU - Yanyan CHANG
AU - Wei ZHANG
AU - Hao WANG
AU - Lina SHI
AU - Yanyan LIU
PY - 2024
DO - 10.1587/transfun.2023EAL2044
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E107-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2024
AB - This letter introduces a prime-factor Galois field Fourier transform (PF-GFFT) architecture to frequency domain decoding (FDD) of cyclic codes. Firstly, a fast FDD scheme is designed which converts the original single longer Fourier transform to a multi-dimensional smaller transform. Furthermore, a ladder-shift architecture for PF-GFFT is explored to solve the rearrangement problem of input and output data. In this regard, PF-GFFT is considered as a lower order spectral calculation scheme, which has sufficient preponderance in reducing the computational complexity. Simulation results show that PF-GFFT compares favorably with the current general GFFT, simplified-GFFT (S-GFFT), and circular shifts-GFFT (CS-GFFT) algorithms in time-consuming cost, and is nearly an order of magnitude or smaller than them. The superiority is a benefit to improving the decoding speed and has potential application value in decoding cyclic codes with longer code lengths.
ER -