信息瓶颈容量不确定性下的广播方法

A. Steiner, S. Shamai
{"title":"信息瓶颈容量不确定性下的广播方法","authors":"A. Steiner, S. Shamai","doi":"10.1109/ITA50056.2020.9244931","DOIUrl":null,"url":null,"abstract":"This work considers a layered coding approach for efficient transmission of data over a wireless block fading channel, connected to a limited capacity reliable link, known as the bottleneck channel. Two main approaches are considered, the first is an oblivious approach, where the sampled noisy observations are compressed and transmitted over the bottleneck channel without having any knowledge of the original information codebook. This is compared to a decode-forward (non-oblivious) approach where the sampled noisy data is decoded, and whatever is successfully decoded is reliably transmitted over the bottleneck channel. The work is extended for an uncertain bottleneck channel capacity setting, where transmitter is not aware of the available backhaul capacity per transmission, but rather its capacity distribution. In both settings it is possible to analytically describe in closed form expressions, the optimal continuous layering power distribution which maximizes the average achievable rate.","PeriodicalId":137257,"journal":{"name":"2020 Information Theory and Applications Workshop (ITA)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Broadcast Approach under Information Bottleneck Capacity Uncertainty\",\"authors\":\"A. Steiner, S. Shamai\",\"doi\":\"10.1109/ITA50056.2020.9244931\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work considers a layered coding approach for efficient transmission of data over a wireless block fading channel, connected to a limited capacity reliable link, known as the bottleneck channel. Two main approaches are considered, the first is an oblivious approach, where the sampled noisy observations are compressed and transmitted over the bottleneck channel without having any knowledge of the original information codebook. This is compared to a decode-forward (non-oblivious) approach where the sampled noisy data is decoded, and whatever is successfully decoded is reliably transmitted over the bottleneck channel. The work is extended for an uncertain bottleneck channel capacity setting, where transmitter is not aware of the available backhaul capacity per transmission, but rather its capacity distribution. In both settings it is possible to analytically describe in closed form expressions, the optimal continuous layering power distribution which maximizes the average achievable rate.\",\"PeriodicalId\":137257,\"journal\":{\"name\":\"2020 Information Theory and Applications Workshop (ITA)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 Information Theory and Applications Workshop (ITA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITA50056.2020.9244931\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 Information Theory and Applications Workshop (ITA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITA50056.2020.9244931","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

这项工作考虑了一种分层编码方法,用于在无线块衰落信道上有效传输数据,该信道连接到容量有限的可靠链路,称为瓶颈信道。考虑了两种主要方法,第一种是遗忘方法,其中采样的噪声观测值被压缩并在瓶颈信道上传输,而不需要任何原始信息码本的知识。这与前向解码(非无关的)方法进行了比较,前向解码是对采样的噪声数据进行解码,成功解码的数据通过瓶颈信道可靠地传输。该工作扩展到不确定瓶颈信道容量设置,其中发射机不知道每次传输的可用回程容量,而是其容量分布。在这两种情况下,都可以用封闭形式表达式解析地描述使平均可达率最大化的最优连续分层功率分布。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Broadcast Approach under Information Bottleneck Capacity Uncertainty
This work considers a layered coding approach for efficient transmission of data over a wireless block fading channel, connected to a limited capacity reliable link, known as the bottleneck channel. Two main approaches are considered, the first is an oblivious approach, where the sampled noisy observations are compressed and transmitted over the bottleneck channel without having any knowledge of the original information codebook. This is compared to a decode-forward (non-oblivious) approach where the sampled noisy data is decoded, and whatever is successfully decoded is reliably transmitted over the bottleneck channel. The work is extended for an uncertain bottleneck channel capacity setting, where transmitter is not aware of the available backhaul capacity per transmission, but rather its capacity distribution. In both settings it is possible to analytically describe in closed form expressions, the optimal continuous layering power distribution which maximizes the average achievable rate.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Massive MIMO is Very Useful for Pilot-Free Uplink Communications Simplified Ray Tracing for the Millimeter Wave Channel: A Performance Evaluation On Marton's Achievable Region: Local Tensorization for Product Channels with a Binary Component Improve Robustness of Deep Neural Networks by Coding On Nonnegative CP Tensor Decomposition Robustness to Noise
×
引用
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