In *Proceedings of the IEEE International Symposium on Information Theory (ISIT)*, pages 1769–1773, 2018. Extended version in IEEE Transactions on Information Theory.

Link Paper doi abstract bibtex

Link Paper doi abstract bibtex

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.

@INPROCEEDINGS{ref:conf:CR18:poi, author = {Mahdi Cheraghchi and Jo\~{a}o Ribeiro}, title = {Improved Upper Bounds on the Capacity of the Discrete-Time {Poisson} Channel}, year = 2018, booktitle = {Proceedings of the {IEEE International Symposium on Information Theory (ISIT)}}, pages = {1769--1773}, note = {Extended version in {IEEE Transactions on Information Theory}.}, doi = {10.1109/ISIT.2018.8437514}, url_Link = {https://ieeexplore.ieee.org/document/8437514}, url_Paper = {https://arxiv.org/abs/1801.02745}, abstract = {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. } }

Downloads: 0