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.
No takes yet. Share an insight, caveat, or question.
Tao Tian (2005) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: