Improved Capacity Upper Bounds for the Discrete-Time Poisson Channel

We present new capacity upper bounds for the discrete-time Poisson channel with no dark current and an average-power constraint. These bounds are a simple consequence of techniques developed by one of the authors 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 we re-derive as a special case of our framework. Furthermore, we instantiate our framework to obtain a closed-form bound that noticeably improves the result of Martinez everywhere.

[1]  Jun Chen,et al.  Capacity-Achieving Distributions for the Discrete-Time Poisson Channel—Part I: General Properties and Numerical Techniques , 2014, IEEE Transactions on Communications.

[2]  Jun Chen,et al.  Capacity-Achieving Distributions for the Discrete-Time Poisson Channel—Part II: Binary Inputs , 2014, IEEE Transactions on Communications.

[3]  Urbashi Mitra,et al.  Capacity of Diffusion-Based Molecular Communication Networks Over LTI-Poisson Channels , 2014, IEEE Transactions on Molecular, Biological and Multi-Scale Communications.

[4]  S. Shamai,et al.  Capacity of a pulse amplitude modulated direct detection photon channel , 1990 .

[5]  F. Topsøe.  Some Bounds for the Logarithmic Function , 2004 .

[6]  Jeffrey H. Shapiro,et al.  The Discrete-Time Poisson Channel at Low Input Powers , 2011, IEEE Transactions on Information Theory.

[7]  Amos Lapidoth,et al.  Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels , 2003, IEEE Trans. Inf. Theory.

[8]  John Lygeros,et al.  Efficient Approximation of Channel Capacities , 2015, IEEE Transactions on Information Theory.

[9]  Gregory W. Wornell,et al.  A Refined Analysis of the Poisson Channel in the High-Photon-Efficiency Regime , 2014, IEEE Transactions on Information Theory.

[10]  Liang Wu,et al.  Lower bounds on the capacity for Poisson optical channel , 2014, 2014 Sixth International Conference on Wireless Communications and Signal Processing (WCSP).

[11]  Mahdi Cheraghchi.  Capacity upper bounds for deletion-type channels , 2018, STOC.

[12]  Saikat Guha,et al.  On capacity of optical channels with coherent detection , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[13]  Amos Lapidoth,et al.  On the Capacity of the Discrete-Time Poisson Channel , 2009, IEEE Transactions on Information Theory.

[14]  Jihai Cao,et al.  Lower bounds on the capacity of discrete-time Poisson channels with dark current , 2010, 2010 25th Biennial Symposium on Communications.

[15]  Gregory W. Wornell,et al.  Refined analysis of the Poisson channel in the high-photon-efficiency regime , 2012, 2012 IEEE Information Theory Workshop.

[16]  CheraghchiMahdi.  Capacity Upper Bounds for Deletion-type Channels , 2019 .

[17]  Alfonso Martinez,et al.  Spectral efficiency of optical direct detection , 2007 .