Capacities and Optimal Input Distributions for Particle-Intensity Channels

Capacities and Optimal Input Distributions for Particle-Intensity Channels
复制标题

DOI:
10.1109/tmbmc.2020.3035371
复制
发表时间:
2020-05
期刊:
IEEE Transactions on Molecular, Biological and Multi-Scale Communications
影响因子:
--
通讯作者:
N. Farsad;W. Chuang;A. Goldsmith;C. Komninakis;Muriel M'edard;C. Rose;L. Vandenberghe;Emily E. Wesel;R. Wesel
N. Farsad;W. Chuang;A. Goldsmith;C. Komninakis;Muriel M'edard;C. Rose;L. Vandenberghe;Emily E. Wesel;R. Wesel
中科院分区:
其他
文献类型:
--
作者:
N. Farsad;W. Chuang;A. Goldsmith;C. Komninakis;Muriel M'edard;C. Rose;L. Vandenberghe;Emily E. Wesel;R. Wesel

文献摘要

被引文献

相似文献

这项工作引入了粒子强度通道(PIC)作为分子通信系统的新模型,其中包括发射器和接收器的缺陷,并提供了容量限制的新表征以及此类通道的最佳(实现容量)输入分布的属性。在 PIC 中,发射器根据粒子释放的概率将信息编码为给定持续时间的符号,接收器根据符号间隔期间检测到的粒子数量来检测和解码消息。在这个通道中,发射器可能无法精确控制粒子释放的概率,接收器也可能无法检测到所有到达的粒子。我们使用二项式通道的推广对该通道进行建模,并表明该通道的容量实现输入分布始终具有粒子释放概率为零和一的质点。为了找到实现容量的输入分布,我们开发了一种新颖且高效的算法,称为动态分配 Blahut-Arimoto (DAB)。对于扩散粒子输运,我们还推导了具有两个质点的输入达到容量的条件。
This work introduces the particle-intensity channel (PIC) as a new model for molecular communication systems that includes imperfections at both transmitter and receiver and provides a new characterization of the capacity limits as well as properties of the optimal (capacity-achieving) input distributions for such channels. In the PIC, the transmitter encodes information, in symbols of a given duration, based on the probability of particle release, and the receiver detects and decodes the message based on the number of particles detected during the symbol interval. In this channel, the transmitter may be unable to control precisely the probability of particle release, and the receiver may not detect all the particles that arrive. We model this channel using a generalization of the binomial channel and show that the capacity-achieving input distribution for this channel always has mass points at probabilities of particle release of zero and one. To find the capacity-achieving input distributions, we develop a novel and efficient algorithm we call dynamic assignment Blahut-Arimoto (DAB). For diffusive particle transport, we also derive the conditions under which the input with two mass points is capacity-achieving.