An Efficient Construction Method for Ultra-Reliable Finite Length Analog Fountain Codes

Zixuan Huang, K. Zhang, J. Jiao, Lianqin Li, Shaohua Wu, Qinyu Zhang
{"title":"An Efficient Construction Method for Ultra-Reliable Finite Length Analog Fountain Codes","authors":"Zixuan Huang, K. Zhang, J. Jiao, Lianqin Li, Shaohua Wu, Qinyu Zhang","doi":"10.1109/ICCCHINA.2018.8641107","DOIUrl":null,"url":null,"abstract":"Ultra-reliable low latency communication (URLLC) is defined by the the third generation partnership project (3GPP) for the fifth generation (5G) mobile systems. In order to realize the stringent requirements of ultra-high reliability and low latency, the data block length needs to be small. However, most of the state-of-art channel codes are designed and optimized for long block length. Analog fountain code (AFC) is a capacity-approaching self-adaptive code on wireless channels with linear encoding/decoding complexity. In this paper, we study the optimization of AFC in the finite length regime. We first analyze the effect of average degree on decoding performance of AFC in the finite length regime. Then, based on the characteristic of weight coefficient in AFC, we proposed a joint design of weight optimization (WO) progressive edge growth (PEG)-AFC algorithm to improve the decoding performance in the finite length regime, named PEG-AFC algorithm. Simulation results show that the proposed PEG-AFC algorithm can achieve lower bit error rate (BER) in a wide range of signal to noise ratio (SNR).","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCHINA.2018.8641107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Ultra-reliable low latency communication (URLLC) is defined by the the third generation partnership project (3GPP) for the fifth generation (5G) mobile systems. In order to realize the stringent requirements of ultra-high reliability and low latency, the data block length needs to be small. However, most of the state-of-art channel codes are designed and optimized for long block length. Analog fountain code (AFC) is a capacity-approaching self-adaptive code on wireless channels with linear encoding/decoding complexity. In this paper, we study the optimization of AFC in the finite length regime. We first analyze the effect of average degree on decoding performance of AFC in the finite length regime. Then, based on the characteristic of weight coefficient in AFC, we proposed a joint design of weight optimization (WO) progressive edge growth (PEG)-AFC algorithm to improve the decoding performance in the finite length regime, named PEG-AFC algorithm. Simulation results show that the proposed PEG-AFC algorithm can achieve lower bit error rate (BER) in a wide range of signal to noise ratio (SNR).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种超可靠有限长模拟喷泉码的有效构造方法
超可靠低延迟通信(URLLC)由第三代合作伙伴计划(3GPP)为第五代(5G)移动系统定义。为了实现超高可靠性和低时延的严格要求,数据块长度需要很小。然而,大多数最先进的信道代码都是针对长块长度进行设计和优化的。模拟喷泉码(AFC)是无线信道上一种容量逼近的自适应码,具有线性编解码复杂度。本文研究了有限长度区域内AFC的优化问题。首先分析了有限长度域下平均度对AFC译码性能的影响。然后,根据AFC中权系数的特点,提出了一种联合设计的权优化(WO)渐进边缘增长(PEG)-AFC算法,以提高有限长度域的解码性能,称为PEG-AFC算法。仿真结果表明,在较宽的信噪比范围内,PEG-AFC算法可以实现较低的误码率(BER)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Adaptive Power Allocation for D2D Assisted Cooperative Relaying System with NOMA Hybrid Transmission Time Intervals for TCP Slow Start in Mobile Edge Computing System UE Computation Offloading Based on Task and Channel Prediction of Single User A Modified Unquantized Fano Sequential Decoding Algorithm for Rateless Spinal Codes Cooperative Slotted Aloha with Reservation for Multi-Receiver Satellite IoT Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1