Neural Polar Decoders for DNA Data Storage

• URL: http://arxiv.org/abs/2506.17076v1
• Date: Fri, 20 Jun 2025 15:26:38 GMT
• Title: Neural Polar Decoders for DNA Data Storage
• Authors: Ziv Aharoni, Henry D. Pfister,
• Abstract summary: Synchronization errors, such as insertions and deletions, present a fundamental challenge in DNA-based data storage systems.<n>We propose a data-driven approach based on neural polar decoders (NPDs) to design low-complexity decoders for channels with synchronization errors.
• Score: 10.362077573132634
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Synchronization errors, such as insertions and deletions, present a fundamental challenge in DNA-based data storage systems, arising from both synthesis and sequencing noise. These channels are often modeled as insertion-deletion-substitution (IDS) channels, for which designing maximum-likelihood decoders is computationally expensive. In this work, we propose a data-driven approach based on neural polar decoders (NPDs) to design low-complexity decoders for channels with synchronization errors. The proposed architecture enables decoding over IDS channels with reduced complexity $O(AN log N )$, where $A$ is a tunable parameter independent of the channel. NPDs require only sample access to the channel and can be trained without an explicit channel model. Additionally, NPDs provide mutual information (MI) estimates that can be used to optimize input distributions and code design. We demonstrate the effectiveness of NPDs on both synthetic deletion and IDS channels. For deletion channels, we show that NPDs achieve near-optimal decoding performance and accurate MI estimation, with significantly lower complexity than trellis-based decoders. We also provide numerical estimates of the channel capacity for the deletion channel. We extend our evaluation to realistic DNA storage settings, including channels with multiple noisy reads and real-world Nanopore sequencing data. Our results show that NPDs match or surpass the performance of existing methods while using significantly fewer parameters than the state-of-the-art. These findings highlight the promise of NPDs for robust and efficient decoding in DNA data storage systems.

Related papers

• Neural Polar Decoders for Deletion Channels [10.362077573132634]
  This paper introduces a neural polar decoder (NPD) for deletion channels with a constant deletion rate.<n>Existing polar decoders for deletion channels exhibit high computational complexity of $O(N4)$, where $N$ is the block length.<n>We demonstrate that employing NPDs for deletion channels can reduce the computational complexity.
  arXiv  Detail & Related papers  (2025-07-16T15:22:34Z)
• Code Rate Optimization via Neural Polar Decoders [19.03393799585162]
  We propose a method to optimize communication code rates via the application of neural polar decoders (NPDs)<n>We employ NPDs to estimate mutual information (MI) between the channel inputs and outputs, and optimize a model of the input distribution.<n>We show significant improvements in MI and bit error rates (BERs) over those achieved by uniform and independent and identically distributed input distributions.
  arXiv  Detail & Related papers  (2025-06-18T19:22:26Z)
• Data-Driven Neural Polar Codes for Unknown Channels With and Without Memory [20.793209871685445]
  We propose a data-driven methodology for designing polar codes for channels with and without memory. The proposed method leverages the structure of the successive cancellation (SC) decoder to devise a neural SC (NSC) decoder. The NSC decoder uses neural networks (NNs) to replace the core elements of the original SC decoder, the check-node, the bit-node and the soft decision.
  arXiv  Detail & Related papers  (2023-09-06T16:44:08Z)
• Joint Channel Estimation and Feedback with Masked Token Transformers in Massive MIMO Systems [74.52117784544758]
  This paper proposes an encoder-decoder based network that unveils the intrinsic frequency-domain correlation within the CSI matrix. The entire encoder-decoder network is utilized for channel compression. Our method outperforms state-of-the-art channel estimation and feedback techniques in joint tasks.
  arXiv  Detail & Related papers  (2023-06-08T06:15:17Z)
• DUIDD: Deep-Unfolded Interleaved Detection and Decoding for MIMO Wireless Systems [25.372069988747114]
  Iterative detection and decoding (IDD) is known to achieve near-capacity performance in multi-antenna wireless systems. We propose deep-unfolded interleaved detection and decoding (DUIDD), a new paradigm that reduces the complexity of IDD while achieving even lower error rates.
  arXiv  Detail & Related papers  (2022-12-15T13:32:36Z)
• NAF: Neural Attenuation Fields for Sparse-View CBCT Reconstruction [79.13750275141139]
  This paper proposes a novel and fast self-supervised solution for sparse-view CBCT reconstruction. The desired attenuation coefficients are represented as a continuous function of 3D spatial coordinates, parameterized by a fully-connected deep neural network. A learning-based encoder entailing hash coding is adopted to help the network capture high-frequency details.
  arXiv  Detail & Related papers  (2022-09-29T04:06:00Z)
• Denoising Diffusion Error Correction Codes [92.10654749898927]
  Recently, neural decoders have demonstrated their advantage over classical decoding techniques. Recent state-of-the-art neural decoders suffer from high complexity and lack the important iterative scheme characteristic of many legacy decoders. We propose to employ denoising diffusion models for the soft decoding of linear codes at arbitrary block lengths.
  arXiv  Detail & Related papers  (2022-09-16T11:00:50Z)
• Graph Neural Networks for Channel Decoding [71.15576353630667]
  We showcase competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results.
  arXiv  Detail & Related papers  (2022-07-29T15:29:18Z)
• Two-Timescale End-to-End Learning for Channel Acquisition and Hybrid Precoding [94.40747235081466]
  We propose an end-to-end deep learning-based joint transceiver design algorithm for millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems. We develop a DNN architecture that maps the received pilots into feedback bits at the receiver, and then further maps the feedback bits into the hybrid precoder at the transmitter.
  arXiv  Detail & Related papers  (2021-10-22T20:49:02Z)
• Doubly Residual Neural Decoder: Towards Low-Complexity High-Performance Channel Decoding [19.48350605321212]
  Deep neural networks have been successfully applied in channel coding to improve the decoding performance. We propose doubly residual neural (DRN) decoder. DRN enables significant decoding performance improvement while maintaining low complexity.
  arXiv  Detail & Related papers  (2021-02-08T01:48:16Z)
• End-to-End Learning of Neuromorphic Wireless Systems for Low-Power Edge Artificial Intelligence [38.518936229794214]
  We introduce a novel "all-spike" low-power solution for remote wireless inference that is based on neuromorphic sensing, Impulse Radio (IR), and Spiking Neural Networks (SNNs) We introduce an end-to-end training procedure that treats the cascade of encoder, channel, and decoder as a probabilistic SNN-based autoencoder that implements Joint Source-Channel Coding (JSCC) The experiments confirm that the proposed end-to-end neuromorphic edge architecture provides a promising framework for efficient and low-latency remote sensing, communication, and inference.
  arXiv  Detail & Related papers  (2020-09-03T09:10:16Z)
• DeepSIC: Deep Soft Interference Cancellation for Multiuser MIMO Detection [98.43451011898212]
  In multiuser multiple-input multiple-output (MIMO) setups, where multiple symbols are simultaneously transmitted, accurate symbol detection is challenging. We propose a data-driven implementation of the iterative soft interference cancellation (SIC) algorithm which we refer to as DeepSIC. DeepSIC learns to carry out joint detection from a limited set of training samples without requiring the channel to be linear.
  arXiv  Detail & Related papers  (2020-02-08T18:31:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.