Paper Info
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.
Year
Venue
Keywords
2016
2016 International Symposium on Information Theory and Its Applications (ISITA)
trapping sets,windowed decoding,spatially coupled low-density parity-check codes,sparse graph codes,memoryless binary input channels,protograph SC-LDPC codes
Field
DocType
ISBN
Discrete mathematics,BCJR algorithm,Concatenated error correction code,Sequential decoding,Berlekamp–Welch algorithm,Computer science,Low-density parity-check code,Block code,Theoretical computer science,Linear code,Decoding methods
Conference
978-1-5090-1917-5
Citations 
PageRank 
References 
0
0.34
7
Authors
2
Name
Order
Citations
PageRank
Allison Beemer114.41
Christine A. Kelley2367.47