首页 | 官方网站   微博 | 高级检索  
     

REGULAR LOW-DENSITY PARITY-CHECK CODES BASED ON SHIFTED IDENTITY MATRICES
作者姓名:He  Shanbao  Zhao  Chunming  Jiang  Ming
作者单位:National Mobile Communications Research Lab, Southeast University, Nanjing 210096, China
基金项目:Supported by the Key Project of National Nature Sci- ence Foundation of China (No.60390540).
摘    要:This paper extends the class of Low-Density Parity-Check (LDPC) codes that can be constructed from shifted identity matrices. To construct regular LDPC codes, a new method is proposed. Two simple inequations are adopted to avoid the short cycles in Tanner graph, which makes the girth of Tanner graphs at least 8. Because their parity-check matrices are made up of circulant matrices, the new codes are quasi-cyclic codes. They perform well with iterative decoding.

关 键 词:低密度奇偶校验码  LDPC  准循环码  过程编码
收稿时间:2004-02-09
修稿时间:2004-10-18

Regular Low-Density Parity-Check codes based on shifted identity matrices
He Shanbao Zhao Chunming Jiang Ming.REGULAR LOW-DENSITY PARITY-CHECK CODES BASED ON SHIFTED IDENTITY MATRICES[J].Journal of Electronics,2006,23(1):20-22.
Authors:Shanbao He  Chunming Zhao  Ming Jiang
Affiliation:National Mobile Communications Research Lab,Southeast University,Nanjing 210096,China
Abstract:This paper extends the class of Low-Density Parity-Check (LDPC) codes that can be constructed from shifted identity matrices. To construct regular LDPC codes, a new method is proposed. Two simple inequations are adopted to avoid the short cycles in Tanner graph, which makes the girth of Tanner graphs at least 8. Because their parity-check matrices are made up of circulant matrices, the new codes are quasi-cyclic codes. They perform well with iterative decoding.
Keywords:Low-Density Parity-Check (LDPC) codes  Quasi-cyclic codes  Construction of codes  Sum-product decoding
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录!
点击此处可从《电子科学学刊(英文版)》浏览原始摘要信息
点击此处可从《电子科学学刊(英文版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号