Abstract
A generalization of the Chinese Remainder Theorem (CRT) combining method is proposed to design much more and better quasi-cyclic (QC) LDPC codes when the parity check matrices of the component codes are given. It can design a much larger class of QC-LDPC codes with similar performance by loosening the condition for determining the intermediate parameters. By permuting the block rows of the parity check matrices of the component codes, a lot of QC-LDPC codes with much less 6-cycles and better performance can be designed. At a BER of 10-6 some QC-LDPC codes designed by the generalized combining method outperform those designed by the CRT combining method by 0.5 dB.
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.
