TY - GEN
T1 - Deterministic Identification for MC ISI-Poisson Channel
AU - Salariseddigh, Mohammad J.
AU - Jamali, Vahid
AU - Pereg, Uzi
AU - Boche, Holger
AU - Deppe, Christian
AU - Schober, Robert
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - Several applications of molecular communications (MC) feature an alarm-prompt behavior for which the prevalent Shannon capacity may not be the appropriate performance metric. The identification capacity as an alternative measure for such systems has been motivated and established in the literature. In this paper, we study deterministic identification (DI) for the discrete-time Poisson channel (DTPC) with intersymbol interference (ISI) where the transmitter is restricted to an average and a peak molecule release rate constraint. Such a channel serves as a model for diffusive MC systems featuring long channel impulse responses and employing molecule counting receivers. We derive lower and upper bounds on the DI capacity of the DTPC with ISI when the number of ISI channel taps K may grow with the codeword length n (e.g., due to increasing symbol rate). As a key finding, we establish that for deterministic encoding, the codebook size scales as 2{(n\log n)R assuming that the number of ISI channel taps scales as K=2κ\log n, where R is the coding rate and κ is the ISI rate. Moreover, we show that optimizing κ leads to an effective identification rate [bits/s] that scales linearly with n, which is in contrast to the typical transmission rate [bits/s] that is independent of n.
AB - Several applications of molecular communications (MC) feature an alarm-prompt behavior for which the prevalent Shannon capacity may not be the appropriate performance metric. The identification capacity as an alternative measure for such systems has been motivated and established in the literature. In this paper, we study deterministic identification (DI) for the discrete-time Poisson channel (DTPC) with intersymbol interference (ISI) where the transmitter is restricted to an average and a peak molecule release rate constraint. Such a channel serves as a model for diffusive MC systems featuring long channel impulse responses and employing molecule counting receivers. We derive lower and upper bounds on the DI capacity of the DTPC with ISI when the number of ISI channel taps K may grow with the codeword length n (e.g., due to increasing symbol rate). As a key finding, we establish that for deterministic encoding, the codebook size scales as 2{(n\log n)R assuming that the number of ISI channel taps scales as K=2κ\log n, where R is the coding rate and κ is the ISI rate. Moreover, we show that optimizing κ leads to an effective identification rate [bits/s] that scales linearly with n, which is in contrast to the typical transmission rate [bits/s] that is independent of n.
UR - http://www.scopus.com/inward/record.url?scp=85164699175&partnerID=8YFLogxK
U2 - 10.1109/ICC45041.2023.10278856
DO - 10.1109/ICC45041.2023.10278856
M3 - Conference contribution
AN - SCOPUS:85164699175
T3 - IEEE International Conference on Communications
SP - 6108
EP - 6113
BT - ICC 2023 - IEEE International Conference on Communications
A2 - Zorzi, Michele
A2 - Tao, Meixia
A2 - Saad, Walid
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2023 IEEE International Conference on Communications, ICC 2023
Y2 - 28 May 2023 through 1 June 2023
ER -