A generalized algebraic approach to optimizing SC-LDPC codes

Document Type

Conference Proceeding

Publication Date

7-1-2017

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.

Identifier

85047943178 (Scopus)

ISBN

[9781538632666]

Publication Title

55th Annual Allerton Conference on Communication Control and Computing Allerton 2017

External Full Text Location

https://doi.org/10.1109/ALLERTON.2017.8262802

First Page

672

Last Page

679

Volume

2018-January

Grant

1711056

Fund Ref

Norsk Sykepleierforbund

This document is currently not available here.

Share

COinS