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

离散时间Poisson信道容量的结构性结果和改进的上界

Structural Results and Improved Upper Bounds on the Capacity of the Discrete-Time Poisson Channel

Mahdi Cheraghchi, João Ribeiro

摘要:

新的容量上限提出了离散时间泊松信道,没有暗电流和平均功率约束。这些界限是一个简单的后果,技术开发的二进制删除和重复通道的能力上限看似无关的问题。以前,在平均功率约束不接近零的情况下,最著名的容量上限是由Martinez(JOSA B,2007年)提出的,这是作为本文中开发的框架的特殊情况重新推导的。此外,这个框架被仔细地实例化,以获得一个封闭形式的界限,显着提高马丁内斯的结果无处不在。最后,在平均功率约束和/或峰值功率约束和任意暗电流下,研究了离散时间泊松信道的容量实现分布。特别是,它表明,在平均功率约束下的能力实现分布的支持必须是可数无限的。这肯定地解决了Shamai的一个猜想(IEE Proceedings I,1990)。以前,只知道支撑必须是无界的。

英文摘要:

New capacity upper bounds are presented for the discrete-time Poisson channel with no dark current and an average-power constraint. These bounds are a simple consequence of techniques developed for the seemingly unrelated problem of upper bounding the capacity of binary deletion and repetition channels. Previously, the best known capacity upper bound in the regime where the average-power constraint does not approach zero was due to Martinez (JOSA B, 2007), which is re-derived as a special case of the framework developed in this paper. Furthermore, this framework is carefully instantiated in order to obtain a closed-form bound that noticeably improves the result of Martinez everywhere. Finally, capacity-achieving distributions for the discrete-time Poisson channel are studied under an average-power constraint and/or a peak-power constraint and arbitrary dark current. In particular, it is shown that the support of the capacity-achieving distribution under an average-power constraint only must be countably infinite. This settles a conjecture of Shamai (IEE Proceedings I, 1990) in the affirmative. Previously, it was only known that the support must be unbounded.

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

↑