Quasi-cyclic extension based on PEG algorithm for construction of LDPC codes
Several important relations between the cycle structure on the Tanner graph and the parity-check matrix H of LDPC codes were proved.A new algorithm for constructing LDPC codes was proposed that introduced quasi-cyclic ex-tension method to PEG algorithm.After a basic matrix was constructed with PEG a...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2008-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74654694/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841537526040363008 |
|---|---|
| author | LEI Jing1 WANG Jian-hui1 TANG Chao-jing1 |
| author_facet | LEI Jing1 WANG Jian-hui1 TANG Chao-jing1 |
| author_sort | LEI Jing1 |
| collection | DOAJ |
| description | Several important relations between the cycle structure on the Tanner graph and the parity-check matrix H of LDPC codes were proved.A new algorithm for constructing LDPC codes was proposed that introduced quasi-cyclic ex-tension method to PEG algorithm.After a basic matrix was constructed with PEG algorithm,circulant permutation ma-trices would replace the "1"s in the basic matrix.The new method could eliminate effectively the short cycles in the basic matrix without changing the degree distribution fraction of the basic matrix.Simulations show that the quasi-cyclic extended codes based on PEG algorithm have as good error correcting performance as the LDPC codes generated by PEG algorithm in the same conditions of code length,rate,degree distribution and decoding algorithm.The conclusion of contrastive analysis is that well-chosen cycle structures can improve the decoding performance obviously under the given degree distribution.The proposed algorithm can offer a good performance and low encoding complexity synchronously by taking advantage of the quasi-cyclic code’s characteristic that its parity-check matrix H has less superposition within the cycles. |
| format | Article |
| id | doaj-art-35e2b6a38c264d79940caf213c187bd5 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2008-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-35e2b6a38c264d79940caf213c187bd52025-01-14T08:31:07ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2008-01-0110311074654694Quasi-cyclic extension based on PEG algorithm for construction of LDPC codesLEI Jing1WANG Jian-hui1TANG Chao-jing1Several important relations between the cycle structure on the Tanner graph and the parity-check matrix H of LDPC codes were proved.A new algorithm for constructing LDPC codes was proposed that introduced quasi-cyclic ex-tension method to PEG algorithm.After a basic matrix was constructed with PEG algorithm,circulant permutation ma-trices would replace the "1"s in the basic matrix.The new method could eliminate effectively the short cycles in the basic matrix without changing the degree distribution fraction of the basic matrix.Simulations show that the quasi-cyclic extended codes based on PEG algorithm have as good error correcting performance as the LDPC codes generated by PEG algorithm in the same conditions of code length,rate,degree distribution and decoding algorithm.The conclusion of contrastive analysis is that well-chosen cycle structures can improve the decoding performance obviously under the given degree distribution.The proposed algorithm can offer a good performance and low encoding complexity synchronously by taking advantage of the quasi-cyclic code’s characteristic that its parity-check matrix H has less superposition within the cycles.http://www.joconline.com.cn/zh/article/74654694/PEG algorithmquasi-cyclic extensioncirculant permutation matrixencoding complexitylocalgirthcycle structure |
| spellingShingle | LEI Jing1 WANG Jian-hui1 TANG Chao-jing1 Quasi-cyclic extension based on PEG algorithm for construction of LDPC codes Tongxin xuebao PEG algorithm quasi-cyclic extension circulant permutation matrix encoding complexity localgirth cycle structure |
| title | Quasi-cyclic extension based on PEG algorithm for construction of LDPC codes |
| title_full | Quasi-cyclic extension based on PEG algorithm for construction of LDPC codes |
| title_fullStr | Quasi-cyclic extension based on PEG algorithm for construction of LDPC codes |
| title_full_unstemmed | Quasi-cyclic extension based on PEG algorithm for construction of LDPC codes |
| title_short | Quasi-cyclic extension based on PEG algorithm for construction of LDPC codes |
| title_sort | quasi cyclic extension based on peg algorithm for construction of ldpc codes |
| topic | PEG algorithm quasi-cyclic extension circulant permutation matrix encoding complexity localgirth cycle structure |
| url | http://www.joconline.com.cn/zh/article/74654694/ |
| work_keys_str_mv | AT leijing1 quasicyclicextensionbasedonpegalgorithmforconstructionofldpccodes AT wangjianhui1 quasicyclicextensionbasedonpegalgorithmforconstructionofldpccodes AT tangchaojing1 quasicyclicextensionbasedonpegalgorithmforconstructionofldpccodes |