Abstract

This paper is a continuation of the work in [15] wherein a novel code-construction method was proposed for constructing (3, k) regular LDPC codes. In this paper, the (3, k) construction technique is generalized to construct (5, k) regular code. The basic design of the proposed code-construction utilizes deterministic base matrices for information part and parity part in three stages of code-construction to achieve no rank-deficiency of H, no girth of 4-cycles, non-singular parity part (H par ) and low encoding complexity. A typical performance of proposed (5, k) regular LDPC codes has been shown.

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.