Bounds on the Capacity of ASK Molecular Communication Channels with ISI
Information Theory
2015-09-01 v1 Emerging Technologies
math.IT
Abstract
There are now several works on the use of the additive inverse Gaussian noise (AIGN) model for the random transit time in molecular communication~(MC) channels. The randomness invariably causes inter-symbol interference (ISI) in MC, an issue largely ignored or simplified. In this paper we derive an upper bound and two lower bounds for MC based on amplitude shift keying (ASK) in presence of ISI. The Blahut-Arimoto algorithm~(BAA) is modified to find the input distribution of transmitted symbols to maximize the lower bounds. Our results show that over wide parameter values the bounds are close.
Keywords
Cite
@article{arxiv.1508.07440,
title = {Bounds on the Capacity of ASK Molecular Communication Channels with ISI},
author = {Siavash Ghavami and Raviraj Adve and Farshad Lahouti},
journal= {arXiv preprint arXiv:1508.07440},
year = {2015}
}
Comments
7 pages, 4 figures, Accepted in IEEE GLOBECOM 2015