A Posteriori Probability Calculation for Composite-Symbol DNA Channels With Synchronization Errors
IEEE Access · 2026 · 14 · 39061-39072
DOI: 10.1109/access.2026.3672396 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Access, 2026. Verfasst von Haruhiko Kaneko und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 31 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Kayamori Foundation of Informational Science Advancement.
Abstract (Originalsprache)
The composite-symbol DNA storage scheme expresses the nonbinary information vector $\boldsymbol {c} = (c_{0}, {\dots }, c_{n-1})$ by a set of 4-ary vectors, $\mathcal {X} = \{ \boldsymbol {x}^{0}, {\dots }, \boldsymbol {x}^{r-1} \}$ , where the ratio of the 4-ary symbols in the $i$ th position of $r$ vectors in $\mathcal {X}$ expresses the value of $c_{i}$ . Because each vector $\boldsymbol {x}^{t}$ generally suffers from synchronization (insertion and deletion) errors with high probability, it is essential to accurately estimate $\boldsymbol {c}$ from a noisy version $\mathcal {Y} = \{ \boldsymbol {y}^{0}, {\dots }, \boldsymbol {y}^{r-1} \}$ of $\mathcal {X}$ . This paper proposes a calculation method for the a posteriori probability (APP) $p(c_{i})$ for a given $\mathcal {Y}$ . We construct a factor graph of the joint probability of the random variables of the channel inputs, outputs, and states. Because the graph has cycles, the APP cannot be calculated using the sum-product algorithm with flooding message scheduling. To circumvent this problem, the graph is divided into three segments, where one segment for the iterative calculations does not have cycles. The forward-backward (BCJR) type message scheduling is derived based on the segmented graph structure. The computational complexity of this algorithm is $\mathcal {O}(r)$ , and thus applicable for the composite-symbol scheme with a large $r$ . Numerical results show the mutual information obtained by the maximum a posteriori (MAP) estimation, and also show the computation time of the algorithm. We also demonstrate the decoded block error rate when a regular low-density parity-check (LDPC) code over extended binary field is used as the outer code.
Förderung
- Kayamori Foundation of Informational Science Advancement
Zitieren
APA
Kaneko, H., & Shibata, R. (2026). A Posteriori Probability Calculation for Composite-Symbol DNA Channels With Synchronization Errors. IEEE Access, 14, 39061-39072. https://doi.org/10.1109/access.2026.3672396
Vancouver
Kaneko H, Shibata R. A Posteriori Probability Calculation for Composite-Symbol DNA Channels With Synchronization Errors. IEEE Access. 2026;14:39061-39072. doi:10.1109/access.2026.3672396
BibTeX
@article{Kaneko2026,
author = {Kaneko, Haruhiko and Shibata, Ryo},
title = {A Posteriori Probability Calculation for Composite-Symbol DNA Channels With Synchronization Errors},
journal = {IEEE Access},
year = {2026},
volume = {14},
pages = {39061--39072},
doi = {10.1109/access.2026.3672396}
}
EUVIMED