使用辅助设备进行调制和估算

IF 2.2 3区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Information Theory Pub Date : 2024-07-03 DOI:10.1109/TIT.2024.3422308
Anatoly Khina;Neri Merhav
{"title":"使用辅助设备进行调制和估算","authors":"Anatoly Khina;Neri Merhav","doi":"10.1109/TIT.2024.3422308","DOIUrl":null,"url":null,"abstract":"The problem of transmitting a parameter value over an additive white Gaussian noise (AWGN) channel is considered, where, in addition to the transmitter and the receiver, there is a helper that observes the noise non-causally and provides a description of limited rate \n<inline-formula> <tex-math>$R_{\\mathrm {h}}$ </tex-math></inline-formula>\n to the transmitter and/or the receiver. We derive upper and lower bounds on the optimal achievable \n<inline-formula> <tex-math>$\\alpha $ </tex-math></inline-formula>\n-th moment of the estimation error and show that they coincide for small values of \n<inline-formula> <tex-math>$\\alpha $ </tex-math></inline-formula>\n and for high values of \n<inline-formula> <tex-math>$R_{\\mathrm {h}}$ </tex-math></inline-formula>\n. The upper bound relies on a recently proposed channel-coding scheme that effectively conveys \n<inline-formula> <tex-math>$R_{\\mathrm {h}}$ </tex-math></inline-formula>\n bits essentially error-free and the rest of the rate—over the same AWGN channel without help, with the error-free bits being allocated to the most significant bits of the quantized parameter. We then concentrate on the setting with a total transmit energy constraint, for which we derive achievability results for both channel coding and parameter modulation for several scenarios: when the helper assists only the transmitter or only the receiver and knows the noise, and when the helper assists the transmitter and/or the receiver and knows both the noise and the message. In particular, for the message-informed helper that assists both the receiver and the transmitter, it is shown that the error probability in the channel-coding task decays doubly exponentially. Finally, we translate these results to those for continuous-time power-limited AWGN channels with unconstrained bandwidth. As a byproduct, we show that the capacity with a message-informed helper that is available only at the transmitter can exceed the sum of the capacity without help and the help rate \n<inline-formula> <tex-math>$R_{\\mathrm {h}}$ </tex-math></inline-formula>\n.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"70 9","pages":"6189-6210"},"PeriodicalIF":2.2000,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Modulation and Estimation With a Helper\",\"authors\":\"Anatoly Khina;Neri Merhav\",\"doi\":\"10.1109/TIT.2024.3422308\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of transmitting a parameter value over an additive white Gaussian noise (AWGN) channel is considered, where, in addition to the transmitter and the receiver, there is a helper that observes the noise non-causally and provides a description of limited rate \\n<inline-formula> <tex-math>$R_{\\\\mathrm {h}}$ </tex-math></inline-formula>\\n to the transmitter and/or the receiver. We derive upper and lower bounds on the optimal achievable \\n<inline-formula> <tex-math>$\\\\alpha $ </tex-math></inline-formula>\\n-th moment of the estimation error and show that they coincide for small values of \\n<inline-formula> <tex-math>$\\\\alpha $ </tex-math></inline-formula>\\n and for high values of \\n<inline-formula> <tex-math>$R_{\\\\mathrm {h}}$ </tex-math></inline-formula>\\n. The upper bound relies on a recently proposed channel-coding scheme that effectively conveys \\n<inline-formula> <tex-math>$R_{\\\\mathrm {h}}$ </tex-math></inline-formula>\\n bits essentially error-free and the rest of the rate—over the same AWGN channel without help, with the error-free bits being allocated to the most significant bits of the quantized parameter. We then concentrate on the setting with a total transmit energy constraint, for which we derive achievability results for both channel coding and parameter modulation for several scenarios: when the helper assists only the transmitter or only the receiver and knows the noise, and when the helper assists the transmitter and/or the receiver and knows both the noise and the message. In particular, for the message-informed helper that assists both the receiver and the transmitter, it is shown that the error probability in the channel-coding task decays doubly exponentially. Finally, we translate these results to those for continuous-time power-limited AWGN channels with unconstrained bandwidth. As a byproduct, we show that the capacity with a message-informed helper that is available only at the transmitter can exceed the sum of the capacity without help and the help rate \\n<inline-formula> <tex-math>$R_{\\\\mathrm {h}}$ </tex-math></inline-formula>\\n.\",\"PeriodicalId\":13494,\"journal\":{\"name\":\"IEEE Transactions on Information Theory\",\"volume\":\"70 9\",\"pages\":\"6189-6210\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2024-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Information Theory\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10583940/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10583940/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

我们考虑了在加性白高斯噪声(AWGN)信道上传输参数值的问题,在该信道中,除了发射机和接收机外,还有一个辅助设备,它可以非因果地观测噪声,并向发射机和/或接收机提供有限速率 $R_{\mathrm {h}}$ 的描述。我们推导出了估计误差的最佳可实现 $\alpha $ -th 矩的上下限,并证明它们在 $\alpha $ 值较小和 $R_{\mathrm {h}}$ 值较高时是重合的。上界依赖于最近提出的一种信道编码方案,该方案可以在相同的 AWGN 信道上有效地传输 $R_{\mathrm {h}}$ 比特,基本上不产生误差,而其余的速率则无需帮助,其中不产生误差的比特被分配给量化参数中最重要的比特。然后,我们将注意力集中在有总发射能量限制的情况下,并在以下几种情况下推导出信道编码和参数调制的可实现性结果:当帮助者只协助发射机或接收机并知道噪声时,以及当帮助者协助发射机和/或接收机并知道噪声和信息时。特别是,对于同时协助接收方和发送方的消息灵通求助者,研究表明信道编码任务中的错误概率呈双指数衰减。最后,我们将这些结果转化为带宽不受限制的连续时间功率限制 AWGN 信道的结果。作为副产品,我们证明了使用仅在发射器可用的消息信息帮助器时的容量可以超过无帮助时的容量与帮助率 $R_{\mathrm {h}}$ 的总和。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Modulation and Estimation With a Helper
The problem of transmitting a parameter value over an additive white Gaussian noise (AWGN) channel is considered, where, in addition to the transmitter and the receiver, there is a helper that observes the noise non-causally and provides a description of limited rate $R_{\mathrm {h}}$ to the transmitter and/or the receiver. We derive upper and lower bounds on the optimal achievable $\alpha $ -th moment of the estimation error and show that they coincide for small values of $\alpha $ and for high values of $R_{\mathrm {h}}$ . The upper bound relies on a recently proposed channel-coding scheme that effectively conveys $R_{\mathrm {h}}$ bits essentially error-free and the rest of the rate—over the same AWGN channel without help, with the error-free bits being allocated to the most significant bits of the quantized parameter. We then concentrate on the setting with a total transmit energy constraint, for which we derive achievability results for both channel coding and parameter modulation for several scenarios: when the helper assists only the transmitter or only the receiver and knows the noise, and when the helper assists the transmitter and/or the receiver and knows both the noise and the message. In particular, for the message-informed helper that assists both the receiver and the transmitter, it is shown that the error probability in the channel-coding task decays doubly exponentially. Finally, we translate these results to those for continuous-time power-limited AWGN channels with unconstrained bandwidth. As a byproduct, we show that the capacity with a message-informed helper that is available only at the transmitter can exceed the sum of the capacity without help and the help rate $R_{\mathrm {h}}$ .
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory 工程技术-工程:电子与电气
CiteScore
5.70
自引率
20.00%
发文量
514
审稿时长
12 months
期刊介绍: The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.
期刊最新文献
Table of Contents IEEE Transactions on Information Theory Publication Information IEEE Transactions on Information Theory Information for Authors Large and Small Deviations for Statistical Sequence Matching Derivatives of Entropy and the MMSE Conjecture
×
引用
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