arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.01994cs.ITmath.ITmath.OC
收藏

MIMO高斯信道的反馈容量

Feedback Capacity of MIMO Gaussian Channels

Oron Sabag, Victoria Kostina, Babak Hassibi

摘要:

在有色高斯噪声和加性噪声的情况下,寻找信道反馈容量的可计算表达式是一个长期存在的问题。在本文中,我们解决了这个问题的情况下,信道具有多个输入和多个输出(MIMO)和噪声过程中产生的时不变的状态空间模型的输出。我们的主要结果是一个有限维凸优化的反馈能力的可计算表达式。反馈容量问题的解决方案是通过制定有限块对应的容量问题作为一个\emph{sequential convex optimization problem},从而导致一个单字母的上限。这种逆向推导集成了来自信息论、控制、滤波和凸优化的工具和思想。一个紧密的下界是通过优化一个家庭的时不变的政策,从而表明时不变的输入是最佳的,即使当噪声过程可能不是平稳的。最佳的时不变策略被用来构建一个容量实现和简单的编码方案的标量信道,其分析揭示了一个有趣的平滑问题和反馈容量表达式之间的关系。

英文摘要:

Finding a computable expression for the feedback capacity of channels with colored Gaussian, additive noise is a long standing open problem. In this paper, we solve this problem in the scenario where the channel has multiple inputs and multiple outputs (MIMO) and the noise process is generated as the output of a time-invariant state-space model. Our main result is a computable expression for the feedback capacity in terms of a finite-dimensional convex optimization. The solution to the feedback capacity problem is obtained by formulating the finite-block counterpart of the capacity problem as a \emph{sequential convex optimization problem} which leads in turn to a single-letter upper bound. This converse derivation integrates tools and ideas from information theory, control, filtering and convex optimization. A tight lower bound is realized by optimizing over a family of time-invariant policies thus showing that time-invariant inputs are optimal even when the noise process may not be stationary. The optimal time-invariant policy is used to construct a capacity-achieving and simple coding scheme for scalar channels, and its analysis reveals an interesting relation between a smoothing problem and the feedback capacity expression.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑