Abstract
For decoding of LDPC codes two types of algorithms are frequently discussed in the literature. One type is based on belief propagation (BP) the other is based on linear programming (LP). Especially for short LDPC codes it has been observed that BP decoding often performs better at low SNR ranges, whereas LP decoding performs better at high SNR levels. A combined linear programming and belief propagation decoder is presented, which significantly outperforms both a pure LP and a pure BP decoder throughout the whole SNR range.
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.
