TY - GEN
T1 - Cycle-Free Windows of SC-LDPC Codes
AU - McMillon, Emily
AU - Kelley, Christine A.
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - In this paper, we define a window code to be the portion of an SC-LDPC code seen by a single iteration of a windowed decoder. We consider the design of SC-LDPC codes for windowed decoding via optimization of the window code. In particular, because iterative decoding is optimal on codes with cycle-free graph representations, we ask fundamental questions about the construction and parameters of cycle-free window codes. Further, we show that it is possible to have an SC-LDPC code with cycles and with cycle-free window codes.
AB - In this paper, we define a window code to be the portion of an SC-LDPC code seen by a single iteration of a windowed decoder. We consider the design of SC-LDPC codes for windowed decoding via optimization of the window code. In particular, because iterative decoding is optimal on codes with cycle-free graph representations, we ask fundamental questions about the construction and parameters of cycle-free window codes. Further, we show that it is possible to have an SC-LDPC code with cycles and with cycle-free window codes.
UR - http://www.scopus.com/inward/record.url?scp=85136253679&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85136253679&partnerID=8YFLogxK
U2 - 10.1109/ISIT50566.2022.9834404
DO - 10.1109/ISIT50566.2022.9834404
M3 - Conference contribution
AN - SCOPUS:85136253679
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 390
EP - 395
BT - 2022 IEEE International Symposium on Information Theory, ISIT 2022
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2022 IEEE International Symposium on Information Theory, ISIT 2022
Y2 - 26 June 2022 through 1 July 2022
ER -