欢迎访问《电讯技术》编辑部网站！

首页 期刊简介编委会征稿启事出版道德声明审稿流程读者订阅论文查重联系我们English

引用本文：

潘宇,徐友云,张海滨,罗汉文.构造接近香农极限的低密度校验码[J].电讯技术，2005，45（4）：24 - 27. [点击复制]
.Construction of Low-Density Parity-Check Code Approaching the Shannon Limit[J].，2005，45（4）：24 - 27. [点击复制]

本文已被：浏览 1885次下载 71次	码上扫一扫！
构造接近香农极限的低密度校验码

0 字体:加大+\|默认\|缩小-
()

摘要:

低密度校验(LDPC)码的性能优劣在很大程度上取决于该码的最小环长(Girth)和最小码距。本文采用几何构造方法构造最小环长为8的LDPC码,联合随机搜索算法改善其码重分布,所构造的LDPC码在码长为4k、编码效率为0.95时,距离香农极限仅1.1dB。

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

DOI：10.3969/j.issn.1001-893X.

投稿时间：2004-09-02

基金项目:国家高技术研究发展计划(863计划);国家自然科学基金

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

()

Abstract:

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 1.1dB 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.

Key words: Low-density Parity Check (LDPC)code,Construction based on Geometry,Bipartite graph,Girth,Minimum distance,Randomized search algorithm