Abstract
In this paper, we constructed a type of parity-check matrices of QC-LDPC codes based on the progressive edge-growth (PEG) algorithm with suggested unreliable factors incorporated. The proposed algorithm can eliminate short cycles efficiently and gain low error-floors. With this method, we can avoid the unreliable information transferred in decoding as far as possible. The proposed QC-LDPC codes are hardware-friendly due to the benefit from the quasi-cyclic structure of such codes. Simulation results demonstrate that the codes constructed with the proposed algorithm have better performance than those constructed with the PEG algorithm over the additive white Gaussian noise (AWGN) channel and the PR4-equalized magnetic recording channel (MRC).
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.
