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

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 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 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 must only 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 an unbounded set.

[1]  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.

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

[3]  Jihad Fahs,et al.  On Properties of the Support of Capacity-Achieving Distributions for Additive Noise Channel Models With Input Cost Constraints , 2016, IEEE Transactions on Information Theory.

[4]  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.

[5]  Tolga M. Duman,et al.  On the Discreteness of Capacity-Achieving Distributions for Fading and Signal-Dependent Noise Channels With Amplitude-Limited Inputs , 2018, IEEE Transactions on Information Theory.

[6]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[7]  Saikat Guha,et al.  On capacity of optical channels with coherent detection , 2011, ISIT.

[8]  Alfonso Martinez,et al.  A lower bound for the capacity of the discrete-time Poisson channel , 2009, 2009 IEEE International Symposium on Information Theory.

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

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

[11]  M. Abramowitz,et al.  Handbook of Mathematical Functions With Formulas, Graphs and Mathematical Tables (National Bureau of Standards Applied Mathematics Series No. 55) , 1965 .

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

[13]  Jeffrey H. Shapiro,et al.  The Poisson Channel at Low Input Powers , 2008, ArXiv.

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

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

[16]  Mahdi Cheraghchi.  Capacity Upper Bounds for Deletion-type Channels , 2019, J. ACM.

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

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

[19]  Joel G. Smith,et al.  The Information Capacity of Amplitude- and Variance-Constrained Scalar Gaussian Channels , 1971, Inf. Control..

[20]  Vahid Tarokh,et al.  Bounds on the Capacity of Discrete Memoryless Channels Corrupted by Synchronization and Substitution Errors , 2012, IEEE Transactions on Information Theory.

[21]  Michael Mitzenmacher,et al.  Capacity Bounds for Sticky Channels , 2008, IEEE Transactions on Information Theory.

[22]  Shlomo Shamai,et al.  When are discrete channel inputs optimal? — Optimization techniques and some new results , 2018, 2018 52nd Annual Conference on Information Sciences and Systems (CISS).

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

[24]  Ibrahim C. Abou-Faycal,et al.  The capacity of discrete-time memoryless Rayleigh-fading channels , 2001, IEEE Trans. Inf. Theory.

[25]  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).