用户名: 密码: 验证码:
一种适用于短码长LT码的改进编码算法
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:An Improved Encoding Scheme for Short Length LT Codes
  • 作者:宋鑫 ; 廖育荣 ; 丁丹
  • 英文作者:SONG Xin;LIAO Yu-rong;DING Dan;Department of Graduate Management,Space and Engineering University;Department of Electronic and Optical Engineering,Space and Engineering University;
  • 关键词:信道编码 ; LT码 ; 编码算法 ; 高斯信道 ; 误比特率
  • 英文关键词:channel code;;LT codes;;encoding scheme;;Gaussian channel;;bit error rate
  • 中文刊名:KXJS
  • 英文刊名:Science Technology and Engineering
  • 机构:航天工程大学研究生院;航天工程大学电子与光学工程系;
  • 出版日期:2019-02-08
  • 出版单位:科学技术与工程
  • 年:2019
  • 期:v.19;No.473
  • 基金:国家“863”计划(2015AA7026085)资助
  • 语种:中文;
  • 页:KXJS201904023
  • 页数:6
  • CN:04
  • ISSN:11-4688/T
  • 分类号:149-154
摘要
LT码是第一种实用的无速率码,但短码长LT码在加性高斯白噪声(AWGN)信道中的性能不佳,原因是度数为1的校验节点的数量过少以及小度数值信息节点的存在。为了提高短码长LT码的误比特率(BER)性能,提出了一种改进编码算法。改进算法引入了权重因子和小度数分布函数用以间接地提高度数为1的校验节点的比例,从而提高了译码成功概率。算法按度数值从小到大的顺序将信息节点分类成若干个集合,并通过改变校验节点选择信息节点的方式,使得靠前集合中的信息节点始终能被优先选取,从而消除了小度数值的信息节点。仿真结果表明,改进算法在给定信噪比和码率值条件下均能实现BER性能的提升,且最多可获得近4. 6 d B的性能增益。
        As the first practical realization of rateless codes,short length LT codes perform poorly in additive white Gaussian noise channel. The reason for this lies in the lack of degree 1 check nodes( CNs) and small degree information nodes( INs). In order to improve the bit error rate( BER) performance of short length LT codes,an improved encoding scheme is proposed. A new degree distribution and two weighting factors are presented,which are used to improve the proportion of degree 1 CNs and increase the probability of decoding successfully. INs are sorted into several sets according to their degrees,and then CNs will preferentially select INs as their neighbors from small degree sets. Thus small degree INs were eliminated. Simulation results show that the proposed scheme can improve the BER performance across a given range of SNR and overhead values,and the proposed LT code can achieve performance improvement up to about 4. 6 d B.
引文
1 Costa M,Pinho M. An algorithm for optimal unequal error protection rate allocation exploring granular channel rates[J]. IEEE Communication Letters,2018,22(5):926-929
    2 Luby M. LT codes[C]//Symposium on Foundations of Computer Science. New York:IEEE,2002:271-280
    3 Shokrollahi A. Raptor codes[J]. IEEE Transactions on Information Theory,2006,52(6):2551-2567
    4 Li G T,Wu H K,Lee H C,et al. Systematic physical layer Raptor coding to attain low decoding complexity[J]. IEEE Communications Letters,2018,22(6):1124-1127
    5 Wu J,Cheng B,Wang M. Improving multipath video transmission with Raptor codes in heterogeneous wireless networks[J]. IEEE Transactions on Multimedia,2018,20(2):457-472
    6 Hussain I,Xiao M,Rasmussen L K. Error floor analysis of LT codes over additive white Gaussian noise channel[C]//Global Telecommunications Conference. New York:IEEE,2011:1-5
    7 焦健,王小博,吴绍华,等.基于叠加度的有限长系统LT码编码方案[J].系统工程与电子技术,2017,39(4):893-898Jiao Jian,Wang Xiaobo,Wu Shaohua,et al. Finite length systematic LT codes based on superposing degree distribution[J]. Journal of Systems Engineering and Electronics,2017,39(4):893-898
    8 姚渭箐,易本顺.基于存储机制的LT码编译码方法[J].系统工程与电子技术,2018,40(1):165-170Yao Weijing,Yi Benshun. Memory-based encoding and decoding of LT codes[J]. Journal of Systems Engineering and Electronics,2018,40(1):165-170
    9 Sorensen J,Koike-Akino T,Orlik P,et al. Ripple design of LT codes for awgn channels[J]. IEEE Transactions on Communications,2014,62(2):434-441
    10 Kharel A,Cao L. Improved fountain codes for BI-AWGN channels[C]//Wireless Communication and Networking Conference. New York:IEEE,2017:1-6
    11 Jayasooriya S,Shirvanimoghaddam M,Ong L,et al. Analysis and design of Raptor codes using a multi-edge framework[J]. IEEE Transactions on Communications,2017,65(12):5123-5136
    12 Kharel A,Cao L. Asymptotic analysis and optimization design of physical layer systematic rateless codes[C]//Consumer Communications and Networking Conference. New York:IEEE,2018:1-6

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700