素域上规则及准规则低密度校验码的构造

doi:10.13190/jbupt.200903.14.lingq

北京邮电大学学报 ›› 2009, Vol. 32 ›› Issue (3): 14-17.doi: 10.13190/jbupt.200903.14.lingq

素域上规则及准规则低密度校验码的构造

林国庆陈汝伟刘原华肖国镇王新梅

西安电子科技大学西安电子科技大学西安电子科技大学西安电子科技大学ISN国家重点实验室

收稿日期:2008-09-23 修回日期:2009-04-10 出版日期:2009-06-28 发布日期:2009-06-28
通讯作者: 林国庆

Construction of Regular or Near-Regular LDPC Codes from Prime Fields

Received:2008-09-23 Revised:2009-04-10 Online:2009-06-28 Published:2009-06-28

摘要/Abstract

摘要：

提出在素域上构造正则及近正则低密度校验码的一种新方法。采用这一方法构造的低密度校验码具有良好的结构。与被广泛研究的低密度校验码array codes as LDPC codes做了仿真比较，结果表明：此方法构造的低密度校验码采用迭代译码时具有优良的性能。

关键词: 低密度校验码,校验矩阵, 素域,本原元

Abstract:

A novel method to construct regular or near-regular Low-density parity-check codes from prime fields is proposed. The low-density parity-check codes constructed by the proposed method have a good structure. Compared the simulation results with those of the widely researched array codes as LDPC codes, it is shown that these Low-density parity-check codes perform well with iterative decoding.

Key words: low-density parity-check (LDPC) code;parity-check matrix, prime field;primitive element

林国庆陈汝伟刘原华肖国镇王新梅. 素域上规则及准规则低密度校验码的构造[J]. 北京邮电大学学报, 2009, 32(3): 14-17.

素域上规则及准规则低密度校验码的构造

Construction of Regular or Near-Regular LDPC Codes from Prime Fields

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 0

编辑推荐

Metrics

本文评价