A generalized algebraic approach to optimizing SC-LDPC codes

Allison Beemer; Salman Habib; Christine A. Kelley; Joerg Kliewer

doi:10.1109/ALLERTON.2017.8262802

A generalized algebraic approach to optimizing SC-LDPC codes

Allison Beemer, Salman Habib, Christine A. Kelley, Joerg Kliewer

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

17 Scopus citations

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. In this paper, we unify all existing SC-LDPC code construction methods under a new generalized description of SC-LDPC codes based on algebraic lifts of graphs. We present an improved low-complexity counting method for the special case of (3,3)-absorbing sets for array-based SC-LDPC codes, which we then use to optimize permutation assignments in SC-LDPC code construction. We show that codes constructed in this way are able to outperform previously published constructions, in terms of the number of dominant absorbing sets and with respect to both standard and windowed decoding.

Original language	English (US)
Title of host publication	55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	672-679
Number of pages	8
ISBN (Electronic)	9781538632666
DOIs	https://doi.org/10.1109/ALLERTON.2017.8262802
State	Published - Jul 1 2017
Event	55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017 - Monticello, United States Duration: Oct 3 2017 → Oct 6 2017

Publication series

Name	55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017
Volume	2018-January

Other

Other	55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017
Country/Territory	United States
City	Monticello
Period	10/3/17 → 10/6/17

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Hardware and Architecture
Signal Processing
Energy Engineering and Power Technology
Control and Optimization

Access to Document

10.1109/ALLERTON.2017.8262802

Cite this

Beemer, A., Habib, S., Kelley, C. A., & Kliewer, J. (2017). A generalized algebraic approach to optimizing SC-LDPC codes. In 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017 (pp. 672-679). (55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017; Vol. 2018-January). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ALLERTON.2017.8262802

Beemer, Allison ; Habib, Salman ; Kelley, Christine A. et al. / A generalized algebraic approach to optimizing SC-LDPC codes. 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 672-679 (55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017).

@inproceedings{af457e705ed6483fbce9e8b7065dceab,

title = "A generalized algebraic approach to optimizing SC-LDPC codes",

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. In this paper, we unify all existing SC-LDPC code construction methods under a new generalized description of SC-LDPC codes based on algebraic lifts of graphs. We present an improved low-complexity counting method for the special case of (3,3)-absorbing sets for array-based SC-LDPC codes, which we then use to optimize permutation assignments in SC-LDPC code construction. We show that codes constructed in this way are able to outperform previously published constructions, in terms of the number of dominant absorbing sets and with respect to both standard and windowed decoding.",

author = "Allison Beemer and Salman Habib and Kelley, {Christine A.} and Joerg Kliewer",

year = "2017",

month = jul,

day = "1",

doi = "10.1109/ALLERTON.2017.8262802",

language = "English (US)",

series = "55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "672--679",

booktitle = "55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017",

address = "United States",

note = "55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017 ; Conference date: 03-10-2017 Through 06-10-2017",

}

Beemer, A, Habib, S, Kelley, CA & Kliewer, J 2017, A generalized algebraic approach to optimizing SC-LDPC codes. in 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017. 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017, vol. 2018-January, Institute of Electrical and Electronics Engineers Inc., pp. 672-679, 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017, Monticello, United States, 10/3/17. https://doi.org/10.1109/ALLERTON.2017.8262802

A generalized algebraic approach to optimizing SC-LDPC codes. / Beemer, Allison; Habib, Salman; Kelley, Christine A. et al.
55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 672-679 (55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017; Vol. 2018-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - A generalized algebraic approach to optimizing SC-LDPC codes

AU - Beemer, Allison

AU - Habib, Salman

AU - Kelley, Christine A.

AU - Kliewer, Joerg

PY - 2017/7/1

Y1 - 2017/7/1

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. In this paper, we unify all existing SC-LDPC code construction methods under a new generalized description of SC-LDPC codes based on algebraic lifts of graphs. We present an improved low-complexity counting method for the special case of (3,3)-absorbing sets for array-based SC-LDPC codes, which we then use to optimize permutation assignments in SC-LDPC code construction. We show that codes constructed in this way are able to outperform previously published constructions, in terms of the number of dominant absorbing sets and with respect to both standard and windowed decoding.

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. In this paper, we unify all existing SC-LDPC code construction methods under a new generalized description of SC-LDPC codes based on algebraic lifts of graphs. We present an improved low-complexity counting method for the special case of (3,3)-absorbing sets for array-based SC-LDPC codes, which we then use to optimize permutation assignments in SC-LDPC code construction. We show that codes constructed in this way are able to outperform previously published constructions, in terms of the number of dominant absorbing sets and with respect to both standard and windowed decoding.

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

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

U2 - 10.1109/ALLERTON.2017.8262802

DO - 10.1109/ALLERTON.2017.8262802

M3 - Conference contribution

T3 - 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017

SP - 672

EP - 679

BT - 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017

Y2 - 3 October 2017 through 6 October 2017

ER -

Beemer A, Habib S, Kelley CA, Kliewer J. A generalized algebraic approach to optimizing SC-LDPC codes. In 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017. Institute of Electrical and Electronics Engineers Inc. 2017. p. 672-679. (55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017). doi: 10.1109/ALLERTON.2017.8262802

A generalized algebraic approach to optimizing SC-LDPC codes

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this