Efficient Binomial Channel Capacity Computation with an Application to Molecular Communication
Name
paper_293.pdf
Description
Accepted version
Size
490.37 KB
Format
Unknown
Checksum (MD5)
65a67c97b55bed86211797f3acc3be31
Author(s)
Wesel, Richard D.
Wesel, Emily E.
Vandenberghe, Lieven
Komninakis, Christos
Medard, Muriel
Date Issued
February 2018
Publisher
IEEE
Citation
Wesel, Richard D., Wesel, Emily E., Vandenberghe, Lieven, Komninakis, Christos and Medard, Muriel. 2018. "Efficient Binomial Channel Capacity Computation with an Application to Molecular Communication."
Version
Author's final manuscript
Abstract
© 2018 IEEE. This paper develops an efficient method to compute the binomial channel capacity and applies it to the molecular channel. The binomial channel (with parameter n) takes the success probability for a Bernoulli trial as input and produces the number of successes in trials as output. The input alphabet is the unit interval and the output alphabet is the set of integers from zero to n. Despite the fact that the input alphabet is uncountably infinite the capacity-achieving input distributions turn out to have a small finite support that evolves gracefully as n increases. The ellipsoid algorithm was previously used to compute the binomial channel capacity, but convergence is rather slow even with a well-chosen initial condition. The Dynamic Assignment Blahut-Arimoto (DAB) algorithm starts with the capacity-achieving mass point locations for the n-1 case and exploits Csiszàr's Min-Max Capacity Theorem to check convergence and adjust mass point locations to achieve a much faster convergence rate, unlocking the potential for the capacity and corresponding input distribution to be computed for larger values of n.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ita.2018.8503225
