Non-Asymptotic Capacity Upper Bounds for the Discrete-Time Poisson Channel with Positive Dark Current

We derive improved and easily computable upper bounds on the capacity of the discrete-time Poisson channel under an average-power constraint and an arbitrary constant dark current term. This is accomplished by combining a general convex duality framework with a modified version of the digamma distribution considered in previous work of the authors (Cheraghchi, J. ACM 2019; Cheraghchi, Ribeiro, IEEE Trans. Inf. Theory 2019). For most choices of parameters, our upper bounds improve upon previous results even when an additional peak-power constraint is imposed on the input.

[1]  S. Hranilovic,et al.  Capacity and nonuniform signaling for discrete-time Poisson channels , 2013, IEEE/OSA Journal of Optical Communications and Networking.

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

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

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

[5]  Information capacity of a photoelectric detector , 1965 .

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

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

[8]  L. Mandel,et al.  Information Rate in an Optical Communication Channel , 1971 .

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

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

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

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

[13]  J. Gordon,et al.  Quantum Effects in Communications Systems , 1962, Proceedings of the IRE.

[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]  Mahdi Cheraghchi,et al.  Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels , 2018, 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[16]  Horst Alzer,et al.  On some inequalities for the incomplete gamma function , 1997, Math. Comput..

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

[18]  Milton Abramowitz,et al.  Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .

[19]  David Paul Brady.  The Analysis of Optical, Direct Detection Communication Systems with Point Process Observations , 1990 .

[20]  Mahdi Cheraghchi,et al.  Improved Upper Bounds and Structural Results on the Capacity of the Discrete-Time Poisson Channel , 2019, IEEE Transactions on Information Theory.

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

[22]  Ellen Hisdal.  Information in a Photon Beam vs Modulation-Level Spacing , 1971 .

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