基于加权图的准循环低密度奇偶校验码构造算法  

Algorithm for constructing QC_LDPC codes based on the weighted map

作　　者：胡家义[1] 王文博[1] 

机构地区：[1]北京邮电大学泛网无线通信教育部重点实验室,北京100876

出　　处：《西安电子科技大学学报》2008年第5期938-941,共4页Journal of Xidian University

基　　金：国家自然科学基金资助(60572120)

摘　　要：提出了大围长准循环低密度奇偶校验码低复杂度构造方法,主要基于加权图来确定满足大围长基矩阵待定位置容许值集合.这些集合无须通过逐一试用所有可能数值来确定,因而大大降低了准循环低密度奇偶校验码的构造复杂度.仿真表明该算法构造出的准循环低密度奇偶校验码具有大围长,且具有好的性能.A low complexity algorithm for constructing Quasi _ cyclic low-density parity-check （QC . LDPC） codes with a large girth is presented. Based on the weighted graph, the algorithm leads to sets of values of all undetermined positions of the base matrix ensuring QC. LDPC with a large girth. The sets of values are determined without trying every possible value so that the complexity for constructing QC. LDPC codes is greatly reduced. Simulations show the algorithm can construct codes with a large girth which have good performances.

关 键 词：低密度奇偶校验码 环 围长 加权图 

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