Channel Coding for Energy Harvesting Communications Using Run Length Limited Codes

Mert Ozates, T. Duman
{"title":"Channel Coding for Energy Harvesting Communications Using Run Length Limited Codes","authors":"Mert Ozates, T. Duman","doi":"10.1109/GLOCOM.2018.8647264","DOIUrl":null,"url":null,"abstract":"We propose a serially concatenated coding scheme to communicate over binary energy harvesting communication channels with additive white Gaussian noise (AWGN), and design explicit and implementable codes for both long and short block lengths. Run length limited (RLL) codes are used to induce the required nonuniform input distributions for both cases. We employ low density parity check (LDPC) codes for long block lengths, while for short block lengths, we utilize convolutional codes as outer error correction codes. We consider different decoding approaches for the two cases, i.e., an iterative decoder is used for the former while Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm over the product trellis of the convolutional and run length limited codes is used for the latter. We also extend our work to joint energy and information transfer for both cases since similar coding solutions can be employed. Numerical examples demonstrate that the newly optimized codes with an inner RLL code are superior to the optimal codes over standard AWGN channels for long block lengths. Our results also show that, for the short block length case, concatenated convolutional and RLL codes with higher minimum distances offer excellent performance.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Global Communications Conference (GLOBECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2018.8647264","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

We propose a serially concatenated coding scheme to communicate over binary energy harvesting communication channels with additive white Gaussian noise (AWGN), and design explicit and implementable codes for both long and short block lengths. Run length limited (RLL) codes are used to induce the required nonuniform input distributions for both cases. We employ low density parity check (LDPC) codes for long block lengths, while for short block lengths, we utilize convolutional codes as outer error correction codes. We consider different decoding approaches for the two cases, i.e., an iterative decoder is used for the former while Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm over the product trellis of the convolutional and run length limited codes is used for the latter. We also extend our work to joint energy and information transfer for both cases since similar coding solutions can be employed. Numerical examples demonstrate that the newly optimized codes with an inner RLL code are superior to the optimal codes over standard AWGN channels for long block lengths. Our results also show that, for the short block length case, concatenated convolutional and RLL codes with higher minimum distances offer excellent performance.
基于运行长度限制码的能量收集通信信道编码
我们提出了一种串行连接的编码方案,在具有加性高斯白噪声(AWGN)的二进制能量收集通信信道上进行通信,并设计了长块长度和短块长度的明确和可实现的编码。在这两种情况下,使用限长码(RLL)来诱导所需的非均匀输入分布。对于长块长度,我们使用低密度奇偶校验(LDPC)码,而对于短块长度,我们使用卷积码作为外部纠错码。对于这两种情况,我们考虑了不同的解码方法,即,前者使用迭代解码器,而后者使用基于卷积码和有限码的积格的Bahl-Cocke-Jelinek-Raviv (BCJR)算法。由于可以采用类似的编码解决方案,我们还将工作扩展到两种情况下的联合能量和信息传输。数值算例表明,对于长块长度的标准AWGN信道,带有内RLL码的新优化码优于最优码。我们的结果还表明,对于短块长度的情况,具有更高最小距离的连接卷积和RLL代码提供了出色的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信