TU Darmstadt / ULB / TUbiblio

Poisson channel with binary Markov input and average sojourn time constraint

Sinzger, M. ; Gehri, M. ; Koeppl, H. (2020)
Poisson channel with binary Markov input and average sojourn time constraint.
ISIT'20 - International Symposium on Information Theory. virtual online conference (21.-26. June 2020)
doi: 10.1109/ISIT44484.2020.9174360
Konferenzveröffentlichung, Bibliographie

Kurzbeschreibung (Abstract)

A minimal model for gene expression, consisting of a switchable promoter together with the resulting messenger RNA, is equivalent to a Poisson channel with a binary Markovian input process. Determining its capacity is an optimization problem with respect to two parameters: the average sojourn times of the promoter’s active (ON) and inactive (OFF) state. An expression for the mutual information is found by solving the associated filtering problem analytically on the level of distributions. For fixed peak power, three bandwidth-like constraints are imposed by lower-bounding (i) the average sojourn times (ii) the autocorrelation time and (iii) the average time until a transition. OFFfavoring optima are found for all three constraints, as commonly encountered for the Poisson channel. In addition, constraint (i) exhibits a region that favors the ON state, and (iii) shows ONfavoring local optima.

Typ des Eintrags: Konferenzveröffentlichung
Erschienen: 2020
Autor(en): Sinzger, M. ; Gehri, M. ; Koeppl, H.
Art des Eintrags: Bibliographie
Titel: Poisson channel with binary Markov input and average sojourn time constraint
Sprache: Englisch
Publikationsjahr: 22 Juni 2020
Veranstaltungstitel: ISIT'20 - International Symposium on Information Theory
Veranstaltungsort: virtual online conference
Veranstaltungsdatum: 21.-26. June 2020
DOI: 10.1109/ISIT44484.2020.9174360
URL / URN: https://ieeexplore.ieee.org/document/9174360
Kurzbeschreibung (Abstract):

A minimal model for gene expression, consisting of a switchable promoter together with the resulting messenger RNA, is equivalent to a Poisson channel with a binary Markovian input process. Determining its capacity is an optimization problem with respect to two parameters: the average sojourn times of the promoter’s active (ON) and inactive (OFF) state. An expression for the mutual information is found by solving the associated filtering problem analytically on the level of distributions. For fixed peak power, three bandwidth-like constraints are imposed by lower-bounding (i) the average sojourn times (ii) the autocorrelation time and (iii) the average time until a transition. OFFfavoring optima are found for all three constraints, as commonly encountered for the Poisson channel. In addition, constraint (i) exhibits a region that favors the ON state, and (iii) shows ONfavoring local optima.

Schlagworte:
Einzelne SchlagworteSprache
Poisson channel, gene expression, binary Markov, average sojourn time, filtering, bandwidth constraintEnglisch
Fachbereich(e)/-gebiet(e): 18 Fachbereich Elektrotechnik und Informationstechnik
18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Nachrichtentechnik > Bioinspirierte Kommunikationssysteme
18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Nachrichtentechnik
Interdisziplinäre Forschungsprojekte
Interdisziplinäre Forschungsprojekte > Centre for Synthetic Biology
Hinterlegungsdatum: 03 Apr 2020 12:28
Letzte Änderung: 23 Sep 2021 14:30
PPN:
Schlagworte:
Einzelne SchlagworteSprache
Poisson channel, gene expression, binary Markov, average sojourn time, filtering, bandwidth constraintEnglisch
Export:
Suche nach Titel in: TUfind oder in Google
Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen