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

基于二进制序列分解的低密度校验码
引用本文:孙涛,朱莉艳. 基于二进制序列分解的低密度校验码[J]. 山东理工大学学报:自然科学版, 2007, 21(5): 53-56
作者姓名:孙涛  朱莉艳
作者单位:扬州大学,数学科学学院,江苏,扬州,225002;扬州大学,数学科学学院,江苏,扬州,225002
摘    要:提出了利用分解二进制序列构造的非正则低密度校验码的新颖简单的方法.仿真结果表明这种方法构造的低密度校验码在高斯白噪声信道BPSK调制下的迭代译码性能很好,并且在没有环长度为4的情况下具有较好的码重分布特性.

关 键 词:低密度校验码  Tanner图  消环  最小环长  序列分解
文章编号:1672-6197(2007)05-0053-04
修稿时间:2007-04-05

Low-density parity-check code based on binary sequence splitting
SUN Tao,ZHU Li-yan. Low-density parity-check code based on binary sequence splitting[J]. Journal of Shandong University of Technology:Science and Technology, 2007, 21(5): 53-56
Authors:SUN Tao  ZHU Li-yan
Affiliation:School of Mathematical Science, Yangzhou University , Yangzhou 225002, China
Abstract:A new and simple approach to construct irregular low-density parity-check(LDPC)code based on the binary sequence splitting was proposed.Experimental results show that constructed irregular LDPC code with iterative decoding perform well over the AWGN channel and have a good code weight distribution with 4-cycle free.
Keywords:LDPC code  Tanner graph  cycle-free  girth  sequence splitting
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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