Avoiding trapping sets in SC-LDPC codes under windowed decoding

Allison Beemer, Christine A Kelley

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless binary input channels. Moreover, protograph SC-LDPC codes have been shown to be asymptotically good under certain conditions. SC-LDPC codes are amenable to a windowed decoder that allows decoding of blocks of bits to be done serially, making them good candidates for applications such as streaming. Depending on how they are constructed, however, the codes may still be prone to error floors. One key element in protograph SC-LDPC code design is the edge-spreading method used to couple copies of the base protograph in the construction of the SC-protograph. In this paper, we present an edge-spreading algorithm that is designed to remove trapping sets from the resulting SC-protograph that are harmful with respect to the windowed decoder, and we examine how to determine which trapping sets should be removed in the construction.

Original languageEnglish (US)
Title of host publicationProceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages206-210
Number of pages5
ISBN (Electronic)9784885523090
StatePublished - Feb 2 2017
Event3rd International Symposium on Information Theory and Its Applications, ISITA 2016 - Monterey, United States
Duration: Oct 30 2016Nov 2 2016

Other

Other3rd International Symposium on Information Theory and Its Applications, ISITA 2016
CountryUnited States
CityMonterey
Period10/30/1611/2/16

Fingerprint

Decoding
candidacy
performance

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems
  • Signal Processing
  • Library and Information Sciences

Cite this

Beemer, A., & Kelley, C. A. (2017). Avoiding trapping sets in SC-LDPC codes under windowed decoding. In Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016 (pp. 206-210). [7840415] Institute of Electrical and Electronics Engineers Inc..

Avoiding trapping sets in SC-LDPC codes under windowed decoding. / Beemer, Allison; Kelley, Christine A.

Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 206-210 7840415.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Beemer, A & Kelley, CA 2017, Avoiding trapping sets in SC-LDPC codes under windowed decoding. in Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016., 7840415, Institute of Electrical and Electronics Engineers Inc., pp. 206-210, 3rd International Symposium on Information Theory and Its Applications, ISITA 2016, Monterey, United States, 10/30/16.
Beemer A, Kelley CA. Avoiding trapping sets in SC-LDPC codes under windowed decoding. In Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc. 2017. p. 206-210. 7840415
Beemer, Allison ; Kelley, Christine A. / Avoiding trapping sets in SC-LDPC codes under windowed decoding. Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 206-210
@inproceedings{941b49ebd53f4d52b0daaff36e448ecb,
title = "Avoiding trapping sets in SC-LDPC codes under windowed decoding",
abstract = "Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless binary input channels. Moreover, protograph SC-LDPC codes have been shown to be asymptotically good under certain conditions. SC-LDPC codes are amenable to a windowed decoder that allows decoding of blocks of bits to be done serially, making them good candidates for applications such as streaming. Depending on how they are constructed, however, the codes may still be prone to error floors. One key element in protograph SC-LDPC code design is the edge-spreading method used to couple copies of the base protograph in the construction of the SC-protograph. In this paper, we present an edge-spreading algorithm that is designed to remove trapping sets from the resulting SC-protograph that are harmful with respect to the windowed decoder, and we examine how to determine which trapping sets should be removed in the construction.",
author = "Allison Beemer and Kelley, {Christine A}",
year = "2017",
month = "2",
day = "2",
language = "English (US)",
pages = "206--210",
booktitle = "Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Avoiding trapping sets in SC-LDPC codes under windowed decoding

AU - Beemer, Allison

AU - Kelley, Christine A

PY - 2017/2/2

Y1 - 2017/2/2

N2 - Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless binary input channels. Moreover, protograph SC-LDPC codes have been shown to be asymptotically good under certain conditions. SC-LDPC codes are amenable to a windowed decoder that allows decoding of blocks of bits to be done serially, making them good candidates for applications such as streaming. Depending on how they are constructed, however, the codes may still be prone to error floors. One key element in protograph SC-LDPC code design is the edge-spreading method used to couple copies of the base protograph in the construction of the SC-protograph. In this paper, we present an edge-spreading algorithm that is designed to remove trapping sets from the resulting SC-protograph that are harmful with respect to the windowed decoder, and we examine how to determine which trapping sets should be removed in the construction.

AB - Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless binary input channels. Moreover, protograph SC-LDPC codes have been shown to be asymptotically good under certain conditions. SC-LDPC codes are amenable to a windowed decoder that allows decoding of blocks of bits to be done serially, making them good candidates for applications such as streaming. Depending on how they are constructed, however, the codes may still be prone to error floors. One key element in protograph SC-LDPC code design is the edge-spreading method used to couple copies of the base protograph in the construction of the SC-protograph. In this paper, we present an edge-spreading algorithm that is designed to remove trapping sets from the resulting SC-protograph that are harmful with respect to the windowed decoder, and we examine how to determine which trapping sets should be removed in the construction.

UR - http://www.scopus.com/inward/record.url?scp=85015215036&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015215036&partnerID=8YFLogxK

M3 - Conference contribution

SP - 206

EP - 210

BT - Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -