带反馈的广播包擦除信道的最优有限长度线性码及其信道色散

Shih-Chun Lin, Yi-Chun Lai, Yu-Chih Huang, Chih-Chun Wang, I-Hsiang Wang
{"title":"带反馈的广播包擦除信道的最优有限长度线性码及其信道色散","authors":"Shih-Chun Lin, Yi-Chun Lai, Yu-Chih Huang, Chih-Chun Wang, I-Hsiang Wang","doi":"10.1109/ITW48936.2021.9611386","DOIUrl":null,"url":null,"abstract":"With the recent emergence of many low-latency applications over wireless networks, the need for accurate finite-length analysis of channel coding over multi-user wireless channels is ever increasing. This paper focuses exclusively on the two-user broadcast packet erasure channel (PEC) with causal feedback, for which existing results show that various linear network coding (LNC) schemes can attain the broadcast capacity region when the block length approaches infinity. Instead of the asymptotic capacity-based analysis, this work derives the exact value of the LNC-based broadcast channel dispersion. Our approach is based on a new explicit characterization of the optimal LNC scheme under any arbitrarily given finite block length. The results show that among all existing asymptotically capacity-achieving LNC schemes, one (class) of them is provably finite-length optimal. By analyzing its second-order asymptotic, we have thus derived the exact (optimal) LNC broadcast channel dispersion, which closes the gap of the state-of-the-art inner and outer bounds previously derived in Lin et al. ISIT 2021","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Optimal finite-length linear codes and the corresponding channel dispersion for broadcast packet erasure channels with feedback\",\"authors\":\"Shih-Chun Lin, Yi-Chun Lai, Yu-Chih Huang, Chih-Chun Wang, I-Hsiang Wang\",\"doi\":\"10.1109/ITW48936.2021.9611386\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the recent emergence of many low-latency applications over wireless networks, the need for accurate finite-length analysis of channel coding over multi-user wireless channels is ever increasing. This paper focuses exclusively on the two-user broadcast packet erasure channel (PEC) with causal feedback, for which existing results show that various linear network coding (LNC) schemes can attain the broadcast capacity region when the block length approaches infinity. Instead of the asymptotic capacity-based analysis, this work derives the exact value of the LNC-based broadcast channel dispersion. Our approach is based on a new explicit characterization of the optimal LNC scheme under any arbitrarily given finite block length. The results show that among all existing asymptotically capacity-achieving LNC schemes, one (class) of them is provably finite-length optimal. By analyzing its second-order asymptotic, we have thus derived the exact (optimal) LNC broadcast channel dispersion, which closes the gap of the state-of-the-art inner and outer bounds previously derived in Lin et al. ISIT 2021\",\"PeriodicalId\":325229,\"journal\":{\"name\":\"2021 IEEE Information Theory Workshop (ITW)\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE Information Theory Workshop (ITW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW48936.2021.9611386\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE Information Theory Workshop (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW48936.2021.9611386","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

随着无线网络上许多低延迟应用程序的出现,对多用户无线信道上信道编码的精确有限长度分析的需求不断增加。本文专门研究了具有因果反馈的双用户广播分组擦除信道(PEC),已有的研究结果表明,当分组长度接近无穷大时,各种线性网络编码(LNC)方案都可以达到广播容量区域。与基于容量的渐近分析不同,本文导出了基于lnc的广播信道色散的精确值。我们的方法是基于任意给定有限块长度下最优LNC方案的一个新的显式表征。结果表明,在已有的渐近容量实现LNC方案中,有一类方案是可证明的有限长最优方案。通过分析其二阶渐近性,我们因此推导出了精确的(最优的)LNC广播信道色散,它缩小了Lin等人先前推导出的最先进的内界和外界的差距。2021年有更深的了解
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal finite-length linear codes and the corresponding channel dispersion for broadcast packet erasure channels with feedback
With the recent emergence of many low-latency applications over wireless networks, the need for accurate finite-length analysis of channel coding over multi-user wireless channels is ever increasing. This paper focuses exclusively on the two-user broadcast packet erasure channel (PEC) with causal feedback, for which existing results show that various linear network coding (LNC) schemes can attain the broadcast capacity region when the block length approaches infinity. Instead of the asymptotic capacity-based analysis, this work derives the exact value of the LNC-based broadcast channel dispersion. Our approach is based on a new explicit characterization of the optimal LNC scheme under any arbitrarily given finite block length. The results show that among all existing asymptotically capacity-achieving LNC schemes, one (class) of them is provably finite-length optimal. By analyzing its second-order asymptotic, we have thus derived the exact (optimal) LNC broadcast channel dispersion, which closes the gap of the state-of-the-art inner and outer bounds previously derived in Lin et al. ISIT 2021
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信