.png){kind=icon}
Return
Reduced-Complexity RS Codes Recognizer Based on Spectra Update Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2023.3277473.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In non-cooperative communication systems, the effective recognition by intercepted bitstream at the 3rd-party receiver is an important mission for military or security purposes. However, the existing recognition schemes lead to long latency and significant hardware due to the large number of traversal operations. Hence, the spectra update algorithm (SUA) is proposed by analyzing the differences between the adjacent reconstructed matrices. Compared with the spectra calculations available like the Galois field Fourier transform (GFFT) and simplified-GFFT (S-GFFT), the presented algorithm reduces the computational complexity to 2/n and 2/? without performance loss, respectively, where n is the code length and ? is the cardinality of the conjugacy class of the corresponding Galois fields. Besides, a reduced-complexity RS recognizer architecture is designed and analyzed to show the effectiveness of the proposed SUA.
Keywords:
Non-cooperative communication
spectra update algorithm (SUA)
galois field fourier transform (GFFT)
recognizer
RS codes
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
View more organizations
Cited Papers
ShareSaveParameter Identification of Reed-Solomon Codes Based on Probability Statistics and Galois Field Fourier Transform.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAIShareSaveShareSaveShareSaveShareSave
View more