CORC  > 北京大学  > 信息科学技术学院
Construction of LDPC codes based on circulant permutation matrices
Qiao, Hua ; Guan, Wu ; Dong, Ming-Ke ; Xiang, Hai-Ge
刊名dianzi yu xinxi xuebaojournal of electronics and information technology
2008
英文摘要Quasi Cyclic LDPC (QC-LDPC) codes are of particular interest in various areas. In this paper, a method to construct a class of QC-LDPC codes based on circulant permutation matrices is showed. The method chooses the position of each non-zero sub-matrix in the bipartite graph based on blocks. Then the circulant permutation value of each sub-matrix is decided. With the proposed algorithm, a few LDPC codes were constructed with the code length from 1008 bit to 8064 bit and with code rate from 1/2 to 7/8. Simulation results show that the proposed LDPC codes are superior to QC-LDPC codes with other construction algorithms.; EI; 0; 10; 2384-2387; 30
语种英语
内容类型期刊论文
源URL[http://ir.pku.edu.cn/handle/20.500.11897/408906]  
专题信息科学技术学院
推荐引用方式
GB/T 7714
Qiao, Hua,Guan, Wu,Dong, Ming-Ke,et al. Construction of LDPC codes based on circulant permutation matrices[J]. dianzi yu xinxi xuebaojournal of electronics and information technology,2008.
APA Qiao, Hua,Guan, Wu,Dong, Ming-Ke,&Xiang, Hai-Ge.(2008).Construction of LDPC codes based on circulant permutation matrices.dianzi yu xinxi xuebaojournal of electronics and information technology.
MLA Qiao, Hua,et al."Construction of LDPC codes based on circulant permutation matrices".dianzi yu xinxi xuebaojournal of electronics and information technology (2008).
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace