首页 | 本学科首页   官方微博 | 高级检索  
     

基于稀疏二进制序列的低密度奇偶校验码
引用本文:何善宝,赵春明,姜 明,史志华. 基于稀疏二进制序列的低密度奇偶校验码[J]. 通信学报, 2005, 26(6): 81-86
作者姓名:何善宝  赵春明  姜 明  史志华
作者单位:东南大学,移动通信国家重点实验室,江苏,南京,210096
基金项目:国家自然基金资助项目(60496311)
摘    要:
通过对低密度奇偶校验(LDPC)码构造的研究,提出了一种利用稀疏二进制序列构造规则LDPC码的新颖而简单的方法。在构造中,还提出了奇偶校验矩阵里元素‘1’的分布矩阵的概念。为了确保码Tanner图的最小圈长为8,利用了序列的周期自相关函数和周期互相关函数。通过仿真表明构造的新码在和积算法下进行迭代解码性能优异。由于产生的LDPC码本身固有的准循环结构,还能得到较低的编码复杂度。

关 键 词:低密度奇偶校验码  稀疏二进制序列  准循环码  迭代解码  和积算法
文章编号:1000-436X(2005)06-0081-06
修稿时间:2004-06-08

Low-density parity-check codes based on sparse binary sequences
HE Shan-bao,Zhao Chun-ming,SHI Zhi-hua,JIANG Ming. Low-density parity-check codes based on sparse binary sequences[J]. Journal on Communications, 2005, 26(6): 81-86
Authors:HE Shan-bao  Zhao Chun-ming  SHI Zhi-hua  JIANG Ming
Abstract:
A novel and simple construction of regular LDPC codes was proposed, which used sparse binary sequences, through studying construction methods of LDPC codes. The distribution matrix of ones in parity-check matrix was introduced into the new construction. The cyclic cross correlation function and the cyclic auto correlation function were utilized to ensure that the girth of Tanner graph was eight. The new codes perform well using the sum-product algorithm for iterative decoding. Low encoding complexity can also be achieved due to the inherent quasi-cyclic structure of the LDPC codes.
Keywords:low-density parity-check codes  sparse binary sequences  quasi-cyclic codes  iterative decoding  sum-product algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《通信学报》浏览原始摘要信息
点击此处可从《通信学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号