构造接近香农极限的低密度校验码  

Construction of Low-Density Parity-Check Code Approaching the Shannon Limit

作　　者：潘宇[1] 徐友云[1] 张海滨[1] 罗汉文[1] 

机构地区：[1]上海交通大学无线通信技术研究所,上海200030

出　　处：《电讯技术》2005年第4期24-27,共4页Telecommunication Engineering

基　　金：国家863计划项目(2003AA12331007);国家自然科学基金重点项目(60332030)

摘　　要：低密度校验(LDPC)码的性能优劣在很大程度上取决于该码的最小环长(Girth)和最小码距。本文采用几何构造方法构造最小环长为8的LDPC码,联合随机搜索算法改善其码重分布,所构造的LDPC码在码长为4k、编码效率为0.95时,距离香农极限仅1.1dB。The performance of Low- density parity- check （LDPC）code depends on the girth and minimum distance to some extent. In this paper, LDPC code with girth 8 is constructed based on geometry algorithms, and its code weight distribution is improved by combined with randomized search algorithm. Simulation results show that I. IdB near to the Shannon limit can be achieved at a bit error rate of 10^-5 using a LDPC block length of 4096 with a code rate of 0.95.

关 键 词：低密度校验码 几何构造 二分图 最小环长 最小码距 随机搜索算法 

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