Abstract
In this letter, two novel single parity-check aided (SPC-aided) adaptive belief propagation (ABP) decoding algorithms are proposed for Reed-Solomon (RS) codes. SPC codes can be used to evaluate the reliability of the information bits in the received RS codewords and modify the log-likelihood ratio (LLR) values of the probably incorrect bits, which can greatly reduce the influence of the pseudo-equilibrium points on the traditional ABP algorithm. Based on this idea, we propose an SPC-aided ABP decoding algorithm. In addition, a new selection scheme of unreliable bits to be sparsified is proposed with the aid of SPC codes. Combining the SPC-aided ABP and this new selection scheme, an enhanced SPC-aided (E-SPC-aided) ABP algorithm is further proposed. The complexity and latency analysis results demonstrate that the two proposed algorithms have lower complexity and decoding latency than the dynamic scheduling strategies. Compared with the traditional ABP, LRBP and HD-P-ABP, simulation results show that the E-SPC-aided ABP algorithm can provide error-correction performance gains of up to 1.1 dB, 0.7 dB and 0.5 dB for RS(255,239) code, respectively at the FER = 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">−3</sup> .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
