The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Approximating Decoding Thresholds of Punctured LDPC Code Ensembles on the AWGN Channel

På svenska

Author

Summary, in English

In this paper, we provide an efficient way to predict iterative belief propagation (BP) decoding thresholds of randomly punctured low-density parity-check (LDPC) code ensembles on the binary-input additive white Gaussian noise channel (AWGNC), given only the BP threshold of the mother code ensemble on the binary erasure channel (BEC) and the code design rate. We show that the predictions are accurate by comparing them with values calculated by discretized density evolution for a variety of puncturing fractions. We find that the strength and suitability of an LDPC code ensemble for random puncturing over the AWGNC with respect to iterative decoding threshold is completely determined by a single constant, and this behavior is demonstrated using both LDPC block code and spatially coupled LDPC code ensembles. Finally, we present simulation results that confirm the excellent decoding performance promised by the asymptotic results.

Publishing year

2015

Language

English

Pages

421-425

Publication/Series

2015 IEEE International Symposium on Information Theory (ISIT)

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • LDPC codes
  • puncturing
  • rate-compatible
  • spatial coupling
  • density evolution

Conference name

IEEE International Symposium on Information Theory (ISIT), 2015

Conference date

2015-06-14 - 2015-06-19

Conference place

Hong Kong, China

Status

Published

Research group

  • Telecommunication Theory

ISBN/ISSN/Other

  • ISBN: 978-1-4673-7704-1