In this paper a new low complexity method for constructing binary quasi-cyclic low-density parity-check (QC-LDPC) codes is introduced. In the proposed method, each block-column of the parity check matrix H is made by a circulant matrix in a way that the associated Tanner graph is free of cycle four. Each circulant matrix in H is made by a generator column. The generator columns should be selected in a way that each associated circulant matrix and every two distinct circulant matrices are free of cycle four. The generator columns are made by row distance sets. An algorithm for generating distance sets and obtaining circulant matrices with columns of weight three is presented separately. Simplicity of construction and having a good flexible family of quasi cyclic LDPC codes both in rate and length are the main properties of the proposed method. The performance of the proposed codes is compared with that of the random-like and Array LDPC codes over an AWGN channel. Simulation results show that from the performance perspective, the constructed codes are competitive with random-like and Array LDPC codes.
This Paper COI Code is JR_ITRC-8-2_006. Also You can use the following address to link to this article. This link is permanent and is used as an article registration confirmation in the Civilica reference:
How to Cite to This Paper:
If you want to refer to this Paper in your research work, you can simply use the following phrase in the resources section:
Tadayon, Mohammad Hesam and Mohammadi, Mohammad,1395,QC-LDPC Codes Construction by Concatenating of Circulant Matrices as Block-Columns ,https://civilica.com/doc/1165946