Deterministic Identification for Molecular Communications over the Poisson Channel

Various applications of molecular communications (MC) are event-triggered, and, as a consequence, the prevalent Shannon capacity may not be the right measure for performance assessment. Thus, in this paper, we motivate and establish the identification capacity as an alternative metric. In particular, we study deterministic identification (DI) for the discrete-time Poisson channel (DTPC), subject to an average and a peak power constraint, which serves as a model for MC systems employing molecule counting receivers. It is established that the codebook size for this channel scales as 2^(nlog n)R, where n and R are the codeword length and coding rate, respectively. Lower and upper bounds on the DI capacity of the DTPC are developed. The obtained large capacity of the DI channel sheds light on the performance of natural DI systems such as natural olfaction, which are known for their extremely large chemical discriminatory power in biology. Furthermore, numerical simulations for the empirical miss-identification and false identification error rates are provided for finite length codes. This allows us to quantify the scale of error reduction in terms of the codeword length.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/20/2022

Deterministic Identification For MC ISI-Poisson Channel

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

Deterministic Identification For MC Binomial Channel

The Binomial channel serves as a fundamental model for molecular communi...
research
07/13/2021

Deterministic Identification Over Poisson Channels

Deterministic identification (DI) for the discrete-time Poisson channel,...
research
12/06/2022

Deterministic K-identification For Slow Fading Channel

Deterministic K-identification (DKI) is addressed for Gaussian channels ...
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
05/02/2023

Memory of recurrent networks: Do we compute it right?

Numerical evaluations of the memory capacity (MC) of recurrent neural ne...
research
01/27/2022

Capacity of First Arrival Position Channel in Diffusion-Based Molecular Communication

In [1], the impulse response of the first arrival position (FAP) channel...

Please sign up or login with your details

Forgot password? Click here to reset