论文标题
从DNA序列的多个读取中恢复的串联代码
Concatenated Codes for Recovery From Multiple Reads of DNA Sequences
论文作者
论文摘要
解码序列源于插入，删除和替换通道对代码字的多次传输是有效脱氧核糖核酸（DNA）数据存储系统的关键组成部分。在本文中，我们考虑了具有外部低密度奇偶校验检查代码以及内部卷积代码或块代码的串联编码方案。我们提出了两种新的解码算法，用于从多个接收到的序列进行推断，包括将内部代码和通道结合到关节隐藏的马尔可夫模型，以推断象征性的后验概率（APPS）。第一个解码器通过共同解码接收到的序列来计算确切的应用程序，而第二个解码器通过组合单独解码的接收序列的结果来近似应用程序。使用所提出的算法，我们通过可实现的信息速率和蒙特卡罗模拟来评估解码多个接收到的序列的性能。与单个接收的序列相比，我们显示出显着的性能增长。
Decoding sequences that stem from multiple transmissions of a codeword over an insertion, deletion, and substitution channel is a critical component of efficient deoxyribonucleic acid (DNA) data storage systems. In this paper, we consider a concatenated coding scheme with an outer low-density parity-check code and either an inner convolutional code or a block code. We propose two new decoding algorithms for inference from multiple received sequences, both combining the inner code and channel to a joint hidden Markov model to infer symbolwise a posteriori probabilities (APPs). The first decoder computes the exact APPs by jointly decoding the received sequences, whereas the second decoder approximates the APPs by combining the results of separately decoded received sequences. Using the proposed algorithms, we evaluate the performance of decoding multiple received sequences by means of achievable information rates and Monte-Carlo simulations. We show significant performance gains compared to a single received sequence.
