Search arXivSearch

arXiv · 1804.04533

The Channel Capacity of Channelrhodopsin and Other Intensity-Driven Signal Transduction Receptors

Abstract

Biological systems transduce signals from their surroundings through a myriad of pathways. In this paper, we describe signal transduction as a communication system: the signal transduction receptor acts as the receiver in this system, and can be modeled as a finite-state Markov chain with transition rates governed by the input signal. Using this general model, we give the mutual information under IID inputs in discrete time, and obtain the mutual information in the continuous-time limit. We show that the mutual information has a concise closed-form expression with clear physical significance. We also give a sufficient condition under which the Shannon capacity is achieved with IID inputs. We illustrate our results with three examples: the light-gated Channelrhodopsin-2 (ChR2) receptor; the ligand-gated nicotinic acetylcholine (ACh) receptor; and the ligand-gated Calmodulin (CaM) receptor. In particular, we show that the IID capacity of the ChR2 receptor is equal to its Shannon capacity. We finally discuss how the results change if only certain properties of each state can be observed, such as whether an ion channel is open or closed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrew W. Eckford, Peter J. Thomas. 2019-01-24. The Channel Capacity of Channelrhodopsin and Other Intensity-Driven Signal Transduction Receptors. https://arxiv.org/abs/1804.04533

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT