Sinzger, Mark ; Gehri, Maximilian ; Koeppl, Heinz (2022)
Poisson channel with binary Markov input and average sojourn time constraint.
ISIT'20 - International Symposium on Information Theory. Online (21.-26.06.2020)
doi: 10.26083/tuprints-00021525
Konferenzveröffentlichung, Zweitveröffentlichung, Postprint
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: | 2022 | ||||
| Autor(en): | Sinzger, Mark ; Gehri, Maximilian ; Koeppl, Heinz | ||||
| Art des Eintrags: | Zweitveröffentlichung | ||||
| Titel: | Poisson channel with binary Markov input and average sojourn time constraint | ||||
| Sprache: | Englisch | ||||
| Publikationsjahr: | 2022 | ||||
| Ort: | Darmstadt | ||||
| Verlag: | IEEE | ||||
| Buchtitel: | 2020 IEEE International Symposium on Information Theory: Proceedings | ||||
| Veranstaltungstitel: | ISIT'20 - International Symposium on Information Theory | ||||
| Veranstaltungsort: | Online | ||||
| Veranstaltungsdatum: | 21.-26.06.2020 | ||||
| DOI: | 10.26083/tuprints-00021525 | ||||
| URL / URN: | https://tuprints.ulb.tu-darmstadt.de/21525 | ||||
| Zugehörige Links: | |||||
| Herkunft: | Zweitveröffentlichungsservice | ||||
| 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: |
|
||||
| Status: | Postprint | ||||
| URN: | urn:nbn:de:tuda-tuprints-215259 | ||||
| Sachgruppe der Dewey Dezimalklassifikatin (DDC): | 500 Naturwissenschaften und Mathematik > 570 Biowissenschaften, Biologie 600 Technik, Medizin, angewandte Wissenschaften > 620 Ingenieurwissenschaften und Maschinenbau |
||||
| 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: | 26 Jul 2022 08:08 | ||||
| PPN: | |||||
| Zugehörige Links: | |||||
| Schlagworte: |
|
||||
| Export: | |||||
| Suche nach Titel in: | TUfind oder in Google | ||||
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum