LDPC Convolutional Codes Based on Parity Check Polynomials with a Time Period of 3
Yutaka Murakami, Shutai Okamura, Shozo Okasaka, Takaaki Kishigami, Masayuki Orihashi · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2009
We newly design time-varying low-density parity-check convolutional codes (LDPC-CCs) based on parity check polynomials of the convolutional codes with a time period of 3, and show that BER (Bit Error Rate) performance in the time-varying LDPC-CCs with a time period of 3 is better than that in the conventional time-varying LDPC-CCs with a time period of 2 in the same coding rate with the nearly equal constraint length.