Abstract

In this letter, belief propagation (BP) based approximation methods for low density parity check (LDPC) codes are adapted to the Luby transform (LT) soft decoder structure in order to reduce its computational complexity. The bit error rate (BER) performances of the algorithms over the binary input additive white Gaussian noise (BIAWGN) channel are obtained by both theoretically and simulations. For theoretical analysis, the Monte-Carlo density evolution (MC-DE) method is used. In addition, computational complexity analyzes of methods are presented. Results show that the computational complexity can be significantly decreased with a limited performance loss cost.

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.