Year-end Sale % OFF 
Abstract
A Reliability Profile Based Low-Complexity Dynamic Schedule LDPC Decoding
Highlights
I T is well-known that Low-Density Parity-Check (LDPC) codes [1] can obtain performance close to the capacity limit performance by using the sum-product algorithm (SPA) with the Flooding decoding algorithm (FA) [2]
In this paper, we propose a new dynamic schedule called RPD for LDPC codes decoding, based on the concept of Reliability Profile (RP), nodes message is divided into two categories: reliable and unreliable
By using as much message as possible from the latest current iteration instead of the previous iteration to update unreliable message multiple times to speed up the convergence process and increase the total number of updates of effective nodes message, so as to improve the Bit Error Rate (BER) performance
Summary
I T is well-known that Low-Density Parity-Check (LDPC) codes [1] can obtain performance close to the capacity limit performance by using the sum-product algorithm (SPA) with the Flooding decoding algorithm (FA) [2]. To solve the problem of poor convergence BER performance of RBP decoding based on greediness, a residual message transfer algorithm based on residual attenuation is proposed [14] It can prevent decoding resources from being unreasonably occupied by a small number of edges in Tanner graph. Aiming at the slow convergence speed of NR LDPC codes in 5G, a residual based hierarchical confidence propagation algorithm is proposed in [15] by dynamically rearranging the layers between different iterations. This algorithm reduces the decoding complexity with a small BER performance loss. The RPD algorithm accelerates the convergence speed of LDPC decoding and improves the BER performance
Sign-in/Register to view highlights & summary 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.
