Efficient ranking of rate-compatible puncturing patterns for a given LDPC code matrix

Authors:
Sissi X. Wu;Wai Ho Mow
Affiliations:
Department of Electronic and Computer Engineering, The Hong Kong University of Science and Technology;Department of Electronic and Computer Engineering, The Hong Kong University of Science and Technology
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 6
Cited 0

Generalized best-first search strategies and the optimality of A*

Journal of the ACM (JACM)
Modern Coding Theory

Modern Coding Theory
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation

IEEE Transactions on Information Theory
Rate-compatible puncturing of low-density parity-check codes

IEEE Transactions on Information Theory
Regular and irregular progressive edge-growth tanner graphs

IEEE Transactions on Information Theory
Rate-compatible punctured low-density parity-check codes with short block lengths

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a novel criterion to rank puncturing patterns for rate-compatible LDPC codes. Specifically, based on Gaussian approximation density evolution, a cost function is devised to characterize the degree distribution of the punctured code matrices, which are derived from a mother code matrix by matrix transformation. This cost function allows us to effectively compare the expected performance of candidate puncturing patterns and to sort out good ones. Combined with well-designed search algorithms, the proposed criterion can be applied on both standardized Block-LDPC codes and generic binary LDPC codes to get good puncturing patterns with manageable complexity. Numerical simulation results verify the effectiveness of the proposed ranking criterion, and demonstrate that a series of good rate-compatible LDPC codes can be obtained by the proposed ranking criterion.