Ensemble of high performance structured binary convolutional LDPC codes with moderate rates

Abstract

An algebraic construction methodology is proposed to design binary time-invariant convolutional low-density parity-check (LDPC) codes. Assisted by a proposed partial search algorithm, the polynomialform parity-check matrix of the time-invariant convolutional LDPC code is derived by combining some special codewords of an (n, 2, n − 1) code. The achieved convolutional LDPC codes possess the characteristics of comparatively large girth and given syndrome former memory. The objective of our design is to enable the time-invariant convolutional LDPC codes the advantages of excellent error performance and fast encoding. In particular, the error performance of the proposed convolutional LDPC code with small constraint length is superior to most existing convolutional LDPC codes.