Abstract

This paper proposes a method to improve the performance of a low-density parity-check code, by selectively removing some cycles from the associated bipartite graph. The method is based on a modified version of breadth-first search (BFS) algorithm, that we call modified BFS (MBFS). Throughout the paper we will give a detailed description of the algorithm and analytically study its complexity. Simulation results will show that applying MBFS to a given code leads to significant improvement of its performance.

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 call

Disclaimer: 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.