M-DAB: An Input-Distribution Optimization Algorithm for Composite DNA Storage by the Multinomial Channel
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909465885802496 |
|---|---|
| author | Kobovich, Adir Yaakobi, Eitan Weinberger, Nir |
| author_facet | Kobovich, Adir Yaakobi, Eitan Weinberger, Nir |
| contents | Recent experiments have shown that the capacity of DNA storage systems may be significantly increased by synthesizing composite DNA letters. In this work, we model a DNA storage channel with composite inputs as a \textit{multinomial channel}, and propose an optimization algorithm for its capacity achieving input distribution, for an arbitrary number of output reads. The algorithm is termed multidimensional dynamic assignment Blahut-Arimoto (M-DAB), and is a generalized version of the DAB algorithm, proposed by Wesel et al. developed for the binomial channel. We also empirically observe a scaling law behavior of the capacity as a function of the support size of the capacity-achieving input distribution. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_17193 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | M-DAB: An Input-Distribution Optimization Algorithm for Composite DNA Storage by the Multinomial Channel Kobovich, Adir Yaakobi, Eitan Weinberger, Nir Information Theory H.1.1 Recent experiments have shown that the capacity of DNA storage systems may be significantly increased by synthesizing composite DNA letters. In this work, we model a DNA storage channel with composite inputs as a \textit{multinomial channel}, and propose an optimization algorithm for its capacity achieving input distribution, for an arbitrary number of output reads. The algorithm is termed multidimensional dynamic assignment Blahut-Arimoto (M-DAB), and is a generalized version of the DAB algorithm, proposed by Wesel et al. developed for the binomial channel. We also empirically observe a scaling law behavior of the capacity as a function of the support size of the capacity-achieving input distribution. |
| title | M-DAB: An Input-Distribution Optimization Algorithm for Composite DNA Storage by the Multinomial Channel |
| topic | Information Theory H.1.1 |
| url | https://arxiv.org/abs/2309.17193 |