Abstract

Forward error correcting codes are successfully implemented in high speed communication for error-free transmission with high data rate. One such code is Low Density Parity Check (LDPC) code. In this paper, Quasi Cyclic (QC) construction of LDPC code is used and we investigate the performance of various decoding algorithms of QC-LDPC code. Their performances in terms of error correction and complexity are compared. The speed of convergence of various decoding algorithms of LDPC code is analyzed by using the Density Evolution theory. With this thresholding in iterations, the BER performances of different algorithms are simulated. Our results show that the same BER performance can be achieved with reduced number of iterations or the speed of the system can be improved without much sacrifice in BER 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.