.png){kind=icon}
返回
Lifting methods for quasi-cyclic LDPC codes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2006.06031.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we present two simple methods to construct a quasi-cyclic LDPC (QC-LDPC) code of larger length by lifting a given QC-LDPC code. We show that its girth is always larger than or equal to that of the given QC-LDPC code. Applying the methods recursively, it is possible to construct a sequence of QC-LDPC codes generated from a single exponent matrix by proper floor or modulo operations. Simulation results show that they have no serious performance degradation, as compared with randomly constructed LDPC codes.
Keyword:
block-cycle
circulant permutation matrix
lifting
low-density parity-check (LDPC) codes
quasi-cyclic
