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
AN - SCOPUS:85015215036
T3 - Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016
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.
T2 - 3rd International Symposium on Information Theory and Its Applications, ISITA 2016
Y2 - 30 October 2016 through 2 November 2016
ER -