Loading [a11y]/accessibility-menu.js
Construction of Quasi-Cyclic LDPC codes with large girth based on circulant permutation matirx | IEEE Conference Publication | IEEE Xplore

Construction of Quasi-Cyclic LDPC codes with large girth based on circulant permutation matirx


Abstract:

In this paper, we propose an algorithm for removing short-cycles in Quasi-Cyclic (QC) Low-density parity-check (LDPC) codes. First using an algorithm with lower computati...Show More

Abstract:

In this paper, we propose an algorithm for removing short-cycles in Quasi-Cyclic (QC) Low-density parity-check (LDPC) codes. First using an algorithm with lower computational complexity, all the cycles in the parity check matrix H are found. Then following a ruler, we adjust the shift value of circulant permutation matrix (CPM) to remove the short-cycles. This algorithm could ensure that the code after cycle removal process preserves the quasi-cyclic structure. Simulation results show that: comparing with the codes (504,252) and (1008, 504), we achieve 0.1dB improvement both.
Date of Conference: 16-18 May 2013
Date Added to IEEE Xplore: 02 December 2013
ISBN Information:

ISSN Information:

Conference Location: Chongqing, China

References

References is not available for this document.