Complexity Reduction for RS Coded SFH/MFSK System under PBNJ
Li‐Der Jeng, Shing-Hung Chen · International Conference on Digital Information Processing and Communications · 2014
Although soft-decision decoding of Reed-Solomon (RS) code can improve the decoding performance significantly, the complexity of the system is still very high. Therefore, to reduce the complexity of the decoder is an important issue for hardware implementation. In previous research [16], order statistic decoding algorithm (OSD) can be applied to nonbinary RS coded slow frequency hopping (SFH)/ M-ary frequency shift keying (MFSK) system. In this paper, based on nonbinary OSD algorithm, we propose two methods to reduce the complexity of RS decoder. The principle of proposed methods is to reduce the number of the candidate codewords. Numerical results show the performance and complexity of the algorithms under partial band noise jamming (PBNJ) and additive white Gaussian noise (AWGN). Form the results, we find the proposed two methods can achieve the effect of reducing the complexity with reasonable performance.