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.

Randomly Punctured Spatially Coupled LDPC Codes

På svenska

Author

Summary, in English

In this paper, we study random puncturing of protograph-based spatially coupled low-density parity-check (SC- LDPC) code ensembles. We show that, with respect to iterative decoding threshold, the strength and suitability of an LDPC code ensemble for random puncturing over the binary erasure channel (BEC) is completely determined by a single constant that depends only on the rate and iterative decoding threshold of the mother code ensemble. We then use this analysis to show that randomly punctured SC-LDPC code ensembles display near capacity thresholds for a wide range of rates. We also perform an asymptotic minimum distance analysis and show that, like the SC-LDPC mother code ensemble, the punctured SC-LDPC code ensembles are also asymptotically good. Finally, we present some simulation results that confirm the excellent decoding performance promised by the asymptotic results.

Publishing year

2014

Language

English

Publication/Series

[Host publication title missing]

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • rate-compatible
  • puncturing
  • LDPC convolutional codes
  • spatial coupling
  • LDPC codes

Conference name

International Symposium on Turbo Codes & Iterative Information Processing (ISTC), 2014

Conference date

2014-08-18 - 2014-08-22

Conference place

Bremen, Germany

Status

Published

Research group

  • Telecommunication Theory