Frequency Domain Low Complexity Chase Reed–Solomon Decoding Under Blind Recognition Prior Conditions
Yanyan Chang, Wei Zhang, Zhuolun Wu, Yanyan Liu · IEEE Signal Processing Letters · 2025
In non-cooperative communication systems, recognition and decoding are two key technologies that determine whether the receiving terminal can correctly decipher the information. To better utilize the prior information by recognition and improve the decoding performance, a novel frequency domainlow complexity chase (F-LCC) Reed–Solomon (RS) decoding scheme is proposed. Firstly, the relationship between recognition and decoding is analyzed, and the erroneous codewords to be decoded can be selected by analyzing the spectrogram obtained from recognition; Then, the$\eta$-dynamically adjustable multiplicity assignment ($\eta$-DAMA) algorithm is proposed by analyzing the channel soft information, where$\eta$is the number of the most unreliable code positions. Wherein, the number of test vectors$2^{\eta }$is modeled as a function of code length and bit error rate (BER), which solves the problem of traditional decoding algorithms relying on empirical values to determine$\eta$. Simulations verify the frame error rate (FER) of the proposed F-LCC for decoding RS(255,239) with different signal-to-noise ratios (SNRs). The results show that the proposed F-LCC decoding scheme can achieve a gain of 0.3dB and 0.15dB compared with the decoding performance of the existing time domain-LCC (T-LCC) decoding scheme when$\eta$= 3 and$\eta$= 5, respectively.