Abstract
This paper presents two algorithms to recover LDPC codes in an error-free environment. Both algorithms reconstruct the sparse parity-check matrices of LDPC codes based on elementary row transformation, and are equivalent to recognize LDPC codes. The first one is appropriate to the LDPC codes whose parity-check matrices have the double-diagonal structure; the second one is a general algorithm that ensures the second-best solution for every type of LDPC codes. Simulation results show that, these algorithms work well with most of LDPC standards and protocols, including 802.16e, 802.11n, DVB-S2 GJB7296 and GB20600.
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.
