Abstract
A serial Fast Fourier Transform Belief Propagation (FFT-BP) algorithm with low complexity of non-binary LDPC codes decoding is presented in this paper to reduce the effects of short girth. During iteration, part of the variable nodes with short girths will just send messages to its neighbor, which are in the same short girth and avoid the messages from them. In the next iteration decoding, this part of the nodes updates and the newly updated node with sort girth stops updating. Simulations show that the proposed algorithm achieves a better gain to the standard algorithm and reduces complexity at the same time.
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.
