具有存储器的高斯信道反馈容量计算的一些结果

A. Pedram, Takashi Tanaka
{"title":"具有存储器的高斯信道反馈容量计算的一些结果","authors":"A. Pedram, Takashi Tanaka","doi":"10.1109/ALLERTON.2018.8636014","DOIUrl":null,"url":null,"abstract":"We study the problem of computing the capacity of channels with feedback for the class of Gaussian channels with linear state-space models (possibly with hidden states) under the presence of quadratic input constraints. We first show that the input-output directed information is maximized by a Gaussian feedback policy. A few special cases are considered where such an optimization can be performed in a computationally tractable manner. In such cases, we show that the supremum of directed information admits a single-letter expression involving the convex log-determinant program as the block length tends to infinity.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Some Results on the Computation of Feedback Capacity of Gaussian Channels with Memory\",\"authors\":\"A. Pedram, Takashi Tanaka\",\"doi\":\"10.1109/ALLERTON.2018.8636014\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the problem of computing the capacity of channels with feedback for the class of Gaussian channels with linear state-space models (possibly with hidden states) under the presence of quadratic input constraints. We first show that the input-output directed information is maximized by a Gaussian feedback policy. A few special cases are considered where such an optimization can be performed in a computationally tractable manner. In such cases, we show that the supremum of directed information admits a single-letter expression involving the convex log-determinant program as the block length tends to infinity.\",\"PeriodicalId\":299280,\"journal\":{\"name\":\"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"volume\":\"67 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ALLERTON.2018.8636014\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2018.8636014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

研究了一类具有线性状态空间模型(可能具有隐藏状态)的高斯信道在二次输入约束下的带反馈信道容量的计算问题。我们首先证明了输入-输出有向信息通过高斯反馈策略得到最大化。在一些特殊情况下,这样的优化可以以计算上可处理的方式执行。在这种情况下,我们证明了当块长度趋于无穷大时,有向信息的最优允许包含凸对数行列式程序的单字母表达式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Some Results on the Computation of Feedback Capacity of Gaussian Channels with Memory
We study the problem of computing the capacity of channels with feedback for the class of Gaussian channels with linear state-space models (possibly with hidden states) under the presence of quadratic input constraints. We first show that the input-output directed information is maximized by a Gaussian feedback policy. A few special cases are considered where such an optimization can be performed in a computationally tractable manner. In such cases, we show that the supremum of directed information admits a single-letter expression involving the convex log-determinant program as the block length tends to infinity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信