Latency constrained protograph-based LDPC-CC

We propose a windowed decoding scheme for protograph-based LDPC convolutional codes (LDPC-CC) that allows us to efficiently trade-off decoding performance for gains in latency. We study the performance of regular LDPC-CC with the windowed decoding scheme. In particular, we show that the class of LDPC-CC proposed in the literature with good belief propagation performance is ill-suited for windowed decoding. Further, we establish properties of code ensembles with good windowed decoding performance over erasure channels with and without memory.