Error-Trellis State Complexity of LDPC Convolutional Codes Based on Circulant Matrices

M. Tajima, K. Okino, T. Miyagoshi

Let H(D) be the parity-check matrix of an LDPC convolutional code corresponding to the parity-check matrix H of a QC code obtained using the method of Tanner et al. We see that the…