跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2607.22234 · v2

Finite-Support Structure of Optimal i.i.d. Inputs for Finite-Memory Poisson Channels

首次提交 2026-07-24 20:02
版本更新 2026-11-20 00:11
雷达观测 2026-11-20 14:52
arXiv ↗PDF ↗

摘要

Discrete-time Poisson channels with finite intersymbol interference provide a natural model for direct-detection optical links in which multipath memory and signal-dependent shot noise appear simultaneously. Under peak and average optical-intensity constraints, we study the stationary mutual-information-rate optimization under an independent and identically distributed (i.i.d.) input restriction. We prove that every input distribution maximizing the stationary mutual information rate within the i.i.d. input class has finite support. The proof is carried out directly on the entropy rate of the continuous-state hidden Markov output process induced by the finite-memory channel. We first establish a filtering-forgetting estimate whose constants are uniform over all admissible i.i.d. input laws. We then derive the entropy-rate first variation, construct a holomorphic extension of the corresponding influence function, and combine the Karush-Kuhn-Tucker condition with a supralinear growth argument.

作者备注:34 pages, 7 figures

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-20 00:11 · 最新观测版本

Finite-Support Structure of Optimal i.i.d. Inputs for Finite-Memory Poisson Channels

Discrete-time Poisson channels with finite intersymbol interference provide a natural model for direct-detection optical links in which multipath memory and signal-dependent shot noise appear simultaneously. Under peak and average optical-intensity constraints, we study the stationary mutual-information-rate optimization under an independent and identically distributed (i.i.d.) input restriction. We prove that every input distribution maximizing the stationary mutual information rate within the i.i.d. input class has finite support. The proof is carried out directly on the entropy rate of the continuous-state hidden Markov output process induced by the finite-memory channel. We first establish a filtering-forgetting estimate whose constants are uniform over all admissible i.i.d. input laws. We then derive the entropy-rate first variation, construct a holomorphic extension of the corresponding influence function, and combine the Karush-Kuhn-Tucker condition with a supralinear growth argument.

查看此版本解读 →查看此版本原文 ↗