학술논문

Efficient Decoding of Parity-Check Concatenated RS Codes
Document Type
Conference
Source
2022 IEEE 8th International Conference on Computer and Communications (ICCC) Computer and Communications (ICCC), 2022 IEEE 8th International Conference on. :1676-1681 Dec, 2022
Subject
Communication, Networking and Broadcast Technologies
Computing and Processing
Phase change materials
Fading channels
Codes
Modulation
Performance gain
Mathematical models
Encoding
Concatenation scheme
stochastic decoding
Reed-Solomon codes
Language
Abstract
In this paper, we impose a few sparse parity-check (PC) equations to a Reed-Solomon (RS) code as a concatenation of PC and RS codes, which can provide considerable performance gain by an efficient soft-decision decoding for some existing RS coded systems, such as satellite communications. We propose two construction methods for the sub-matrices. The type-1 construction method directly concatenates a specially designed sub-matrix with regular row weight, and the type-2 construction method is developed to achieve a much lower encoding complexity while maintaining the performance gain. With the help of PC concatenation, the quantity of the channel soft information can be refined by the newly added sparse PC equations which significantly improve the performance of Chase-type decoders. In order to reduce the decoding complexity, we propose a threshold-based noise-aided Chase algorithm (TB-NACA) for PC-RS codes, which achieves significant performance gain compared to the hard -decision decoding of the original RS codes. Moreover, the proposed PC-RS code under the TB-NACA decoding can even significantly outperform the conventional Chase-type decoders over the AWGN channels and Rayleigh fading channels with high-order QAM.