Deterministic Identification Over Poisson Channels

Deterministic identification (DI) for the discrete-time Poisson channel, subject to an average and a peak power constraint, is considered. It is established that the code size scales as 2^(nlog n)R, where n and R are the block length and coding rate, respectively. The authors have recently shown a similar property for Gaussian channels [1]. Lower and upper bounds on the DI capacity of the Poisson channel are developed in this scale. Those imply that the DI capacity is infinite in the exponential scale, regardless of the dark current, i.e., the channel noise parameter.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/18/2020

Deterministic Identification Over Fading Channels

Deterministic identification (DI) is addressed for Gaussian channels wit...
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
10/28/2020

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...
research
04/24/2023

Deterministic Identification For MC Binomial Channel

The Binomial channel serves as a fundamental model for molecular communi...
research
03/05/2022

Deterministic Identification for Molecular Communications over the Poisson Channel

Various applications of molecular communications (MC) are event-triggere...
research
11/20/2022

Deterministic Identification For MC ISI-Poisson Channel

Several applications of molecular communications (MC) feature an alarm-p...
research
06/29/2023

Comparing Poisson and Gaussian channels (extended)

Consider a pair of input distributions which after passing through a Poi...

Please sign up or login with your details

Forgot password? Click here to reset