Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Randomly Punctured LDPC Codes

Mitchell, David G.M. ; Lentmaier, Michael LU ; Pusane, Ali E. and Costello Jr., Daniel J. (2016) In IEEE Journal on Selected Areas in Communications 34(2). p.408-421
Abstract
In this paper, we present a random puncturing analysis of low-density parity-check (LDPC) code ensembles. We derive a simple analytic expression for the iterative belief propagation (BP) decoding threshold of a randomly punctured LDPC code ensemble on the binary erasure channel (BEC) and show that, with respect to the BP threshold, the strength and suitability of an LDPC code ensemble for random puncturing is completely determined by a single constant that depends only on the rate and the BP threshold of the mother code ensemble. We then provide an efficient way to accurately predict BP thresholds of randomly punctured LDPC code ensembles on the binary- input additive white Gaussian noise channel (BI-AWGNC), given only the BP threshold of... (More)
In this paper, we present a random puncturing analysis of low-density parity-check (LDPC) code ensembles. We derive a simple analytic expression for the iterative belief propagation (BP) decoding threshold of a randomly punctured LDPC code ensemble on the binary erasure channel (BEC) and show that, with respect to the BP threshold, the strength and suitability of an LDPC code ensemble for random puncturing is completely determined by a single constant that depends only on the rate and the BP threshold of the mother code ensemble. We then provide an efficient way to accurately predict BP thresholds of randomly punctured LDPC code ensembles on the binary- input additive white Gaussian noise channel (BI-AWGNC), given only the BP threshold of the mother code ensemble on the BEC and the design rate, and we show how the prediction can be improved with knowledge of the BI-AWGNC threshold. We also perform an asymptotic minimum distance analysis of randomly punctured code ensembles and present simulation results that confirm the robust decoding performance promised by the asymptotic results. Protograph-based LDPC block code and spatially coupled LDPC code ensembles are used throughout as examples to demonstrate the results. (Less)
Please use this url to cite or link to this publication:
author
; ; and
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
Low-density parity-check (LDPC) codes, spatially coupled codes, rate-compatible codes, punctured codes, iterative decoding, belief propagation, decoding thresholds, binary erasure channel, additive white Gaussian noise channel, minimum distance
in
IEEE Journal on Selected Areas in Communications
volume
34
issue
2
pages
408 - 421
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • wos:000368395000016
  • scopus:84962129746
ISSN
1558-0008
DOI
10.1109/JSAC.2015.2507758
language
English
LU publication?
yes
id
db92e312-8dae-49ad-a81e-71a378e3b2cc (old id 8725968)
date added to LUP
2016-04-01 13:00:20
date last changed
2022-04-13 22:34:09
@article{db92e312-8dae-49ad-a81e-71a378e3b2cc,
  abstract     = {{In this paper, we present a random puncturing analysis of low-density parity-check (LDPC) code ensembles. We derive a simple analytic expression for the iterative belief propagation (BP) decoding threshold of a randomly punctured LDPC code ensemble on the binary erasure channel (BEC) and show that, with respect to the BP threshold, the strength and suitability of an LDPC code ensemble for random puncturing is completely determined by a single constant that depends only on the rate and the BP threshold of the mother code ensemble. We then provide an efficient way to accurately predict BP thresholds of randomly punctured LDPC code ensembles on the binary- input additive white Gaussian noise channel (BI-AWGNC), given only the BP threshold of the mother code ensemble on the BEC and the design rate, and we show how the prediction can be improved with knowledge of the BI-AWGNC threshold. We also perform an asymptotic minimum distance analysis of randomly punctured code ensembles and present simulation results that confirm the robust decoding performance promised by the asymptotic results. Protograph-based LDPC block code and spatially coupled LDPC code ensembles are used throughout as examples to demonstrate the results.}},
  author       = {{Mitchell, David G.M. and Lentmaier, Michael and Pusane, Ali E. and Costello Jr., Daniel J.}},
  issn         = {{1558-0008}},
  keywords     = {{Low-density parity-check (LDPC) codes; spatially coupled codes; rate-compatible codes; punctured codes; iterative decoding; belief propagation; decoding thresholds; binary erasure channel; additive white Gaussian noise channel; minimum distance}},
  language     = {{eng}},
  number       = {{2}},
  pages        = {{408--421}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  series       = {{IEEE Journal on Selected Areas in Communications}},
  title        = {{Randomly Punctured LDPC Codes}},
  url          = {{https://lup.lub.lu.se/search/files/3101741/8725969.pdf}},
  doi          = {{10.1109/JSAC.2015.2507758}},
  volume       = {{34}},
  year         = {{2016}},
}