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

Tanner码不存在四环的充要条件
引用本文:赵莹,肖扬.Tanner码不存在四环的充要条件[J].系统工程与电子技术,2009,31(2):300-304.
作者姓名:赵莹  肖扬
作者单位:北京交通大学信息科学研究所, 北京, 100044
摘    要:现有准循环LDPC码(QC LDPC码)的设计未考虑如何避免短环(四环)问题,而短环的存在导致QCLDPC码的误码率性能远低于随机LDPC码.为解决这一问题,提出在一类重要的准循环LDPC码—Tanner码中避免四环的定理,这些定理可作为构造Tanner码的约束条件.根据提出的定理调整校验矩阵中循环矩阵的维数和移位因子,可以构造无四环的QC LDPC码,同时扩展了Tanner码的定义.最后以实例验证了所提定理,仿真结果表明设计的Tanner码具有良好的误码率性能.

关 键 词:信道编码  循环矩阵  低密度校验码  准循环码
收稿时间:2008-01-04
修稿时间:2008-07-07

Necessary and sufficient condition for Tanner codes without girth 4
ZHAO Ying,XIAO Yang.Necessary and sufficient condition for Tanner codes without girth 4[J].System Engineering and Electronics,2009,31(2):300-304.
Authors:ZHAO Ying  XIAO Yang
Institution:Inst. of Information Science, Beijing Jiaotong Univ., Beijing 100044, China
Abstract:To solve the problem of the girth 4 which will lead to a serious decrease in the performance of quasi-cyclic low-density parity-check(QC LDPC) codes,this paper presents the necessary and sufficient conditions of Tanner codes without girth 4 in the form of several theorems.These theorems can be used as the constraint conditions for the construction of Tanner codes.To construct the Tanner codes without girth 4 needs to adjust the dimension and the shift factors of the circulant matrices of the given sparse parity-check matrices according to the proposed theorems.Examples are provided to verify the theorems,and computer simulation results show that the Tanner codes obtained by proposed constructions achieve good BER performance compared with that of randomly constructed LDPC codes.
Keywords:
本文献已被 万方数据 等数据库收录!
点击此处可从《系统工程与电子技术》浏览原始摘要信息
点击此处可从《系统工程与电子技术》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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