Construction of Rate-Compatible LDPC Codes Utilizing Information Shortening and Parity Puncturing
© T. Tian and C. R. Jones 2005
Received: 27 January 2005
Published: 12 December 2005
This paper proposes a method for constructing rate-compatible low-density parity-check (LDPC) codes. The construction considers the problem of optimizing a family of rate-compatible degree distributions as well as the placement of bipartite graph edges. A hybrid approach that combines information shortening and parity puncturing is proposed. Local graph conditioning techniques for the suppression of error floors are also included in the construction methodology.
Keywordsrate compatibility shortened codes punctured codes irregular low-density parity-check codes density evolution extrinsic message degree
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.