基于循环转置单位矩阵条件填充的LDPC码构造方法  

Construction Based on Conditional-Filling with Cyclic Shift Identity Matrices for LDPC Codes

作　　者：刘建权[1] 刘永山[1] 徐友云[1] 蔡跃明 

机构地区：[1]解放军理工大学通信工程学院,南京210007

出　　处：《电子与信息学报》2007年第12期2902-2906,共5页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(60372080);江苏省自然科学基金(BK2006701)资助课题

摘　　要：通过分析并充分利用循环转置单位矩阵在环中的特性,该文提出了一种基于转置矩阵条件填充的LDPC码构造方法,给出了按此方法构造的校验矩阵最小环长的上、下理论限,并在此基础上提出了一种具体的条件填充构造法,仿真结果表明,该方法能够明显减少校验矩阵的最小环数目,较大程度上提升了码子性能。By analysis and the sufficient utilization of characteristics of the cyclic shift identity matrices in a cycle, the construction based on conditional-filling with shift matrices for LDPC codes is presented, the upper and lower bounds of girth of the check matrix which had been constructed by this scheme is also proposed, and a concrete conditional-filling construction is thus proposed, the simulations prove that the construction can reduce the amount of least cycle of the check matrix remarkably and improve the performance to a larger extent.

关 键 词：LDPC码 最小环长 循环转置单位矩阵 条件填充 

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