The Capacity of the Weighted Read Channel
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914655699468288 |
|---|---|
| author | Yerushalmi, Omer Etzion, Tuvi Yaakobi, Eitan |
| author_facet | Yerushalmi, Omer Etzion, Tuvi Yaakobi, Eitan |
| contents | One of the primary sequencing methods gaining prominence in DNA storage is nanopore sequencing, attributed to various factors. In this work, we consider a simplified model of the sequencer, characterized as a channel. This channel takes a sequence and processes it using a sliding window of length $\ell$, shifting the window by $δ$ characters each time. The output of this channel, which we refer to as the read vector, is a vector containing the sums of the entries in each of the windows. The capacity of the channel is defined as the maximal information rate of the channel. Previous works have already revealed capacity values for certain parameters $\ell$ and $δ$. In this work, we show that when $δ< \ell < 2δ$, the capacity value is given by $\frac{1}δ\log_2 \frac{1}{2}(\ell+1+ \sqrt{(\ell+1)^2 - 4(\ell - δ)(\ell-δ+1)})$. Additionally, we construct an upper bound when $2δ< \ell$. Finally, we extend the model to the two-dimensional case and present several results on its capacity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_15368 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Capacity of the Weighted Read Channel Yerushalmi, Omer Etzion, Tuvi Yaakobi, Eitan Information Theory One of the primary sequencing methods gaining prominence in DNA storage is nanopore sequencing, attributed to various factors. In this work, we consider a simplified model of the sequencer, characterized as a channel. This channel takes a sequence and processes it using a sliding window of length $\ell$, shifting the window by $δ$ characters each time. The output of this channel, which we refer to as the read vector, is a vector containing the sums of the entries in each of the windows. The capacity of the channel is defined as the maximal information rate of the channel. Previous works have already revealed capacity values for certain parameters $\ell$ and $δ$. In this work, we show that when $δ< \ell < 2δ$, the capacity value is given by $\frac{1}δ\log_2 \frac{1}{2}(\ell+1+ \sqrt{(\ell+1)^2 - 4(\ell - δ)(\ell-δ+1)})$. Additionally, we construct an upper bound when $2δ< \ell$. Finally, we extend the model to the two-dimensional case and present several results on its capacity. |
| title | The Capacity of the Weighted Read Channel |
| topic | Information Theory |
| url | https://arxiv.org/abs/2401.15368 |