IEICE TRANSACTIONS on Fundamentals
Prime-Factor GFFT Architecture for Fast Frequency Domain Decoding of Cyclic Codes
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E107-A No.1 pp.174-177
- Publication Date
- 2024/01/01
- Publicized
- 2023/07/10
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2023EAL2044
- Type of Manuscript
- LETTER
- Category
- Coding Theory
Authors
Yanyan CHANG
Tianjin University
Wei ZHANG
Tianjin University
Hao WANG
China Aerospace Science and Technology Corporation
Lina SHI
Tianjin University
Yanyan LIU
Nankai University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
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
Copy
@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},}
Copy
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 -
English
