|Symbolwise MAP Estimation for Multiple-Trace Insertion/Deletion/Substitution Channels
|Ryo Sakogawa, Haruhiko Kaneko, Tokyo Institute of Technology, Japan
|M.8: Insertion Deletion Substitution Codes II
|Coding for Storage and Memories
|Click here to download the manuscript
|Click here to watch in the Virtual Symposium
|In this paper, we work on the symbolwise maximum a posteriori probability (MAP) estimation of channel input symbol from $m$ $(\geq 2)$ received words (traces) having insertion/deletion/substitution (IDS) errors, where the errors are independent between $m$ received words. This problem is motivated by readout process in next-generation sequencers of DNA storage. The MAP estimation is based on the belief propagation algorithm on a factor graph, which represents the joint probability of a channel input word and $m$ pairs of channel output word and drift vector. We also propose a heuristic estimation algorithm for $m \geq 4$ to reduce the computational complexity. Simulation results show the relation between channel IDS error rate and estimation error rate.