LDPC code reconstruction based on algorithm of finding low weight code-words
LDPC code reconstruction without a candidate set is one of the tough problems in channel code reconstruction.First,theoretical analysis was provided for the number of received code-vectors needed for the reconstruction,and a lower bound was derived.Then,according to the lower bound,and based on an a...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2017-06-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017116/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539481151209472 |
|---|---|
| author | Pei-dong YU Hua PENG Ke-xian GONG Ze-liang CHEN |
| author_facet | Pei-dong YU Hua PENG Ke-xian GONG Ze-liang CHEN |
| author_sort | Pei-dong YU |
| collection | DOAJ |
| description | LDPC code reconstruction without a candidate set is one of the tough problems in channel code reconstruction.First,theoretical analysis was provided for the number of received code-vectors needed for the reconstruction,and a lower bound was derived.Then,according to the lower bound,and based on an algorithm for finding low weight code-words,a new reconstruction method was proposed.It looked for low weight vectors one by one from the dual space of the received code-vector space and used them to reconstruct the sparse parity-check matrices.Number of iterations and the computational complexity of the method were analyzed based on exponential distribution theory.Under noise-free conditions,drawbacks of the existing method,including limited applicable range and large quantity of required data,have been overcame.Under noisy conditions,the proposed method has higher robustness against noise and relatively low complexity,compared to existing methods.For QC-LDPC codes,the reconstruction performance can be further improved using the quasi-cyclic property of their sparse parity-check matrices. |
| format | Article |
| id | doaj-art-1b03668ee067423d9f31c04f15899833 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2017-06-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-1b03668ee067423d9f31c04f158998332025-01-14T07:12:13ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2017-06-013810811759709774LDPC code reconstruction based on algorithm of finding low weight code-wordsPei-dong YUHua PENGKe-xian GONGZe-liang CHENLDPC code reconstruction without a candidate set is one of the tough problems in channel code reconstruction.First,theoretical analysis was provided for the number of received code-vectors needed for the reconstruction,and a lower bound was derived.Then,according to the lower bound,and based on an algorithm for finding low weight code-words,a new reconstruction method was proposed.It looked for low weight vectors one by one from the dual space of the received code-vector space and used them to reconstruct the sparse parity-check matrices.Number of iterations and the computational complexity of the method were analyzed based on exponential distribution theory.Under noise-free conditions,drawbacks of the existing method,including limited applicable range and large quantity of required data,have been overcame.Under noisy conditions,the proposed method has higher robustness against noise and relatively low complexity,compared to existing methods.For QC-LDPC codes,the reconstruction performance can be further improved using the quasi-cyclic property of their sparse parity-check matrices.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017116/channel code reconstructionLDPC codequasi-cyclic LDPC codeexponential distribution |
| spellingShingle | Pei-dong YU Hua PENG Ke-xian GONG Ze-liang CHEN LDPC code reconstruction based on algorithm of finding low weight code-words Tongxin xuebao channel code reconstruction LDPC code quasi-cyclic LDPC code exponential distribution |
| title | LDPC code reconstruction based on algorithm of finding low weight code-words |
| title_full | LDPC code reconstruction based on algorithm of finding low weight code-words |
| title_fullStr | LDPC code reconstruction based on algorithm of finding low weight code-words |
| title_full_unstemmed | LDPC code reconstruction based on algorithm of finding low weight code-words |
| title_short | LDPC code reconstruction based on algorithm of finding low weight code-words |
| title_sort | ldpc code reconstruction based on algorithm of finding low weight code words |
| topic | channel code reconstruction LDPC code quasi-cyclic LDPC code exponential distribution |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017116/ |
| work_keys_str_mv | AT peidongyu ldpccodereconstructionbasedonalgorithmoffindinglowweightcodewords AT huapeng ldpccodereconstructionbasedonalgorithmoffindinglowweightcodewords AT kexiangong ldpccodereconstructionbasedonalgorithmoffindinglowweightcodewords AT zeliangchen ldpccodereconstructionbasedonalgorithmoffindinglowweightcodewords |