Skip to main content
  • Research Article
  • Open access
  • Published:

Construction of Rate-Compatible LDPC Codes Utilizing Information Shortening and Parity Puncturing

Abstract

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.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tao Tian.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Tian, T., Jones, C.R. Construction of Rate-Compatible LDPC Codes Utilizing Information Shortening and Parity Puncturing. J Wireless Com Network 2005, 692121 (2005). https://doi.org/10.1155/WCN.2005.789

Download citation

  • Received:

  • Revised:

  • Published:

  • DOI: https://doi.org/10.1155/WCN.2005.789

Keywords