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
이 편지에서는 순환 코드의 주파수 영역 디코딩(FDD)에 대한 소인수 갈루아 필드 푸리에 변환(PF-GFFT) 아키텍처를 소개합니다. 첫째, 원래의 단일 더 긴 푸리에 변환을 다차원 더 작은 변환으로 변환하는 빠른 FDD 방식이 설계되었습니다. 또한 입력 및 출력 데이터의 재배열 문제를 해결하기 위해 PF-GFFT의 래더 시프트 아키텍처를 탐색합니다. 이런 점에서 PF-GFFT는 계산 복잡도를 줄이는 데 충분한 우세를 갖는 저차 스펙트럼 계산 방식으로 간주됩니다. 시뮬레이션 결과에 따르면 PF-GFFT는 시간 소모적인 비용 측면에서 현재의 일반 GFFT, 단순화된 GFFT(S-GFFT) 및 순환 이동-GFFT(CS-GFFT) 알고리즘과 유리하게 비교되며 거의 10배 이하 크기입니다. 그들보다. 이러한 우월성은 디코딩 속도를 향상시키는 이점이며 코드 길이가 더 긴 순환 코드를 디코딩하는 데 잠재적인 적용 가치가 있습니다.
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.
부
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
부
@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},}
부
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 -