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

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

作　　者：林国庆[1] 陈汝伟[2] 刘原华[1] 王新梅[1] 肖国镇[1] 

机构地区：[1]西安电子科技大学综合业务网理论及关键技术国家重点实验室,西安710071 [2]佳林电子科技大学数学与计算科学学院,广西桂林541004

出　　处：《北京邮电大学学报》2009年第3期14-17,共4页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(U0635003);国家高技术研究发展计划项目(2007AA01Z215,2006AA01Z267);桂林电子科技大学科学研究基金(UF09006Y)

摘　　要：提出构造规则及准规则低密度校验码的一种新方法,即利用素域的特殊性质,首先构造素域上满足特定条件的矩阵,然后通过向量替换得到GF(2)上满足RC-约束条件的规则及准规则校验矩阵.采用这一方法构造的低密度校验码有良好的结构,其校验矩阵可以被分解为置换矩阵的阵列或近似置换矩阵的阵列.与一种被广泛研究的低密度校验码进行仿真比较,证实所构造的低密度校验码具有优良的纠错性能.A method to construct regular or near-regular low-density parity-check （LDPC） codes is proposed. The matrix satisfying certain conditions over a prime field is constructed first, and the regu lar or near regular parity-check matrices over GF（2） is obtained by vector substitution. The low-density parity-check codes constructed by the proposed method have a good structure. The parity-check matrices can be decomposed into arrays of permutation matrices, or arrays of near permutation matrices. Compare simulation results with those widely researched array codes as LDPC codes, it is shown that these Low-density parity-cheek codes perform well.

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

分 类 号：TN911.21[电子电信—通信与信息系统]