LDPC codes constructed from resolvable group divisible designs |
| |
| Authors: | SUN Cheng XU Hengzhou FENG Dan BAI Baoming ZHANG Yulong |
| |
| Affiliation: | (1. State Key Lab. of Integrated Service Networks, Xidian Univ., Xi'an 710071, China;
2. Zhoukou Hydrology and Water Resources Survey Bureau of Henan Province, Zhoukou 466000, China) |
| |
| Abstract: | A new construction method for low-density parity-check (LDPC) codes is presented based on resolvable group divisible designs (RGDDs). The resulting LDPC codes are free of 4-cycle. With the use of RGDDs, a class of masking matrices is also constructed, and then many more quasi-cyclic (QC) LDPC codes are obtained by the masking technique. Numerical results show that the proposed LDPC codes with iterative decoding using the sum-product algorithm perform very well over the AWGN channel. Furthermore, the QC-LDPC codes constructed based on masking have a better BER/FER performance than the original ones. |
| |
| Keywords: | LDPC codes girth masking resolvable group divisible designs |
|
| 点击此处可从《西安电子科技大学学报》浏览原始摘要信息 |
|
点击此处可从《西安电子科技大学学报》下载全文 |
