Loading…
Cycle-Free Windows of SC-LDPC Codes
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-fr...
Saved in:
Main Authors: | , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. |
---|---|
ISSN: | 2157-8117 |
DOI: | 10.1109/ISIT50566.2022.9834404 |