论文标题
MC ISI-Poisson通道的确定性识别
Deterministic Identification For MC ISI-Poisson Channel
论文作者
论文摘要
分子通信(MC)的几种应用具有警报贡献行为,普遍的香农容量可能不是适当的性能指标。文献中已经激励并确定了作为此类系统的替代措施的识别能力。在本文中,我们研究了带有符号间干扰(ISI)的离散时间\ emph {poisson}通道(DTPC)的确定性识别(DI),其中发射器仅限于平均分子释放速率约束。这样的频道是具有长通道脉冲响应并采用分子计数接收器的扩散MC系统的模型。当ISI通道TAPS $ k $的数量随着码字$ n $(例如,由于符号率的增加),我们在DTPC的DTPC的DI容量上得出了下限和上限。作为一个关键发现,我们确定对于确定性编码,代码簿的尺寸缩放为$ 2^{(n \ log n)r} $,假设ISI通道TAPS量表的数量为$ k = 2^{κ\ log n} $,其中$ r $是编码率,而$κ$ $κ$是ISI率。此外,我们表明,优化$κ$会导致有效的识别率[BITS/s],该率与$ n $线性缩放,这与典型的传输速率[BITS/s]形成鲜明对比,该速度与$ n $无关。
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 \emph{Poisson} channel (DTPC) with inter-symbol 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$.