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

10/28/2020
by   Mahdi Cheraghchi, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/09/2018

Improved Capacity Upper Bounds for the Discrete-Time Poisson Channel

We present new capacity upper bounds for the discrete-time Poisson chann...
research
07/13/2021

Deterministic Identification Over Poisson Channels

Deterministic identification (DI) for the discrete-time Poisson channel,...
research
11/05/2019

Computable Upper Bounds on the Capacity of Finite-State Channels

The capacity of finite-state channels (FSCs) without feedback is investi...
research
03/05/2022

Deterministic Identification for Molecular Communications over the Poisson Channel

Various applications of molecular communications (MC) are event-triggere...
research
04/24/2023

Deterministic Identification For MC Binomial Channel

The Binomial channel serves as a fundamental model for molecular communi...
research
11/11/2020

Transmission of a Bit over a Discrete Poisson Channel with Memory

A coding scheme for transmission of a bit maps a given bit to a sequence...
research
11/27/2018

Capacity Upper Bounds for the Relay Channel via Reverse Hypercontractivity

The primitive relay channel, introduced by Cover in 1987, is the simples...

Please sign up or login with your details

Forgot password? Click here to reset