Low-density parity-check codes based on sparse binary sequences
A novel and simple construction of regular LDPC codes was proposed, which used sparse binary sequences, through studying construction methods of LDPC codes. The distribution matrix of ones in parity-check matrix was introduced into the new construction. The cyclic cross correlation function and the...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2005-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74667848/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A novel and simple construction of regular LDPC codes was proposed, which used sparse binary sequences, through studying construction methods of LDPC codes. The distribution matrix of ones in parity-check matrix was introduced into the new construction. The cyclic cross correlation function and the cyclic auto correlation function were utilized to ensure that the girth of Tanner graph was eight. The new codes perform well using the sum-product algorithm for iterative decoding. Low encoding complexity can also be achieved due to the inherent quasi-cyclic structure of the LDPC codes. |
|---|---|
| ISSN: | 1000-436X |