The Systematic Form of a Class of Regular Structured LDPC Codes

In this paper, we propose a systematic form about a class of regular structured LDPC codes. This class of LDPC codes is quasi-cyclic code with variable node degree d
_v
= 2 on the Tanner graph. The defining parity-check matrices are composed of circulant permutation matrices. By columns permutation, we can locate the information bits and parity check bits easily. Furthermore, the values of associated parity check bits can be calculated directly on the Tanner graph.