QC-LDPC Codes Construction by Concatenating of Circulant Matrices as Block-Columns
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....
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Iran Telecom Research Center
2016-06-01
|
| Series: | International Journal of Information and Communication Technology Research |
| Subjects: | |
| Online Access: | http://ijict.itrc.ac.ir/article-1-64-en.html |
| _version_ | 1828039327604539392 |
|---|---|
| author | Mohammad Hesam Tadayon Mohammad Mohammadi |
| author_facet | Mohammad Hesam Tadayon Mohammad Mohammadi |
| author_sort | Mohammad Hesam Tadayon |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-10T16:40:11Z |
| format | Article |
| id | doaj.art-92927865ce5f4aa3b1d751362b62458b |
| institution | Directory Open Access Journal |
| issn | 2251-6107 2783-4425 |
| language | English |
| last_indexed | 2024-04-10T16:40:11Z |
| publishDate | 2016-06-01 |
| publisher | Iran Telecom Research Center |
| record_format | Article |
| series | International Journal of Information and Communication Technology Research |
| spelling | doaj.art-92927865ce5f4aa3b1d751362b62458b2023-02-08T07:55:30ZengIran Telecom Research CenterInternational Journal of Information and Communication Technology Research2251-61072783-44252016-06-01824550QC-LDPC Codes Construction by Concatenating of Circulant Matrices as Block-ColumnsMohammad Hesam Tadayon0Mohammad Mohammadi1 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.http://ijict.itrc.ac.ir/article-1-64-en.htmlqc-ldpc codesgirthcirculant matricesawgn channelconcatenation |
| spellingShingle | Mohammad Hesam Tadayon Mohammad Mohammadi QC-LDPC Codes Construction by Concatenating of Circulant Matrices as Block-Columns International Journal of Information and Communication Technology Research qc-ldpc codes girth circulant matrices awgn channel concatenation |
| title | QC-LDPC Codes Construction by Concatenating of Circulant Matrices as Block-Columns |
| title_full | QC-LDPC Codes Construction by Concatenating of Circulant Matrices as Block-Columns |
| title_fullStr | QC-LDPC Codes Construction by Concatenating of Circulant Matrices as Block-Columns |
| title_full_unstemmed | QC-LDPC Codes Construction by Concatenating of Circulant Matrices as Block-Columns |
| title_short | QC-LDPC Codes Construction by Concatenating of Circulant Matrices as Block-Columns |
| title_sort | qc ldpc codes construction by concatenating of circulant matrices as block columns |
| topic | qc-ldpc codes girth circulant matrices awgn channel concatenation |
| url | http://ijict.itrc.ac.ir/article-1-64-en.html |
| work_keys_str_mv | AT mohammadhesamtadayon qcldpccodesconstructionbyconcatenatingofcirculantmatricesasblockcolumns AT mohammadmohammadi qcldpccodesconstructionbyconcatenatingofcirculantmatricesasblockcolumns |