Gumbel-Softmax Discretization Constraint, Differentiable IDS Channel, and an IDS-Correcting Code for DNA Storage

• URL: http://arxiv.org/abs/2407.18929v2
• Date: Mon, 30 Sep 2024 11:58:17 GMT
• Title: Gumbel-Softmax Discretization Constraint, Differentiable IDS Channel, and an IDS-Correcting Code for DNA Storage
• Authors: Alan J. X. Guo, Mengyi Wei, Yufan Dai, Yali Wei, Pengchen Zhang,
• Abstract summary: We present an autoencoder-based method, THEA-code, aimed at efficiently generating IDS-correcting codes for complex IDS channels. A Gumbel-Softmax discretization constraint is proposed to discretize the features of the autoencoder. A simulated differentiable IDS channel is developed as a differentiable alternative for IDS operations.
• Score: 1.4272256806865107
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Insertion, deletion, and substitution (IDS) error-correcting codes have garnered increased attention with recent advancements in DNA storage technology. However, a universal method for designing IDS-correcting codes across varying channel settings remains underexplored. We present an autoencoder-based method, THEA-code, aimed at efficiently generating IDS-correcting codes for complex IDS channels. In the work, a Gumbel-Softmax discretization constraint is proposed to discretize the features of the autoencoder, and a simulated differentiable IDS channel is developed as a differentiable alternative for IDS operations. These innovations facilitate the successful convergence of the autoencoder, resulting in channel-customized IDS-correcting codes with commendable performance across complex IDS channels.

Related papers

• Efficient Transformer-based Decoder for Varshamov-Tenengolts Codes [1.53119329713143]
  Varshamov-Tenengolts (VT) codes, primarily designed for single-error correction, have emerged as a central research focus. While existing decoding methods achieve high accuracy in correcting a single error, they often fail to correct multiple IDS errors. In this work, we observe that VT codes retain some capability for addressing multiple errors by introducing a transformer-based VT decoder.
  arXiv  Detail & Related papers  (2025-02-28T13:59:14Z)
• Decoding for Punctured Convolutional and Turbo Codes: A Deep Learning Solution for Protocols Compliance [22.85778198575678]
  This paper presents a unified Long Short-Term Memory (LSTM)-based decoding architecture. The proposed method unifies punctured convolutional and Turbo codes. A puncture embedding mechanism integrates puncturing patterns directly into the network, enabling seamless adaptation to varying code rates.
  arXiv  Detail & Related papers  (2025-02-21T14:00:14Z)
• Threshold Selection for Iterative Decoding of $(v,w)$-regular Binary Codes [84.0257274213152]
  Iterative bit flipping decoders are an efficient choice for sparse $(v,w)$-regular codes. We propose concrete criteria for threshold determination, backed by a closed form model.
  arXiv  Detail & Related papers  (2025-01-23T17:38:22Z)
• Factor Graph Optimization of Error-Correcting Codes for Belief Propagation Decoding [62.25533750469467]
  Low-Density Parity-Check (LDPC) codes possess several advantages over other families of codes. The proposed approach is shown to outperform the decoding performance of existing popular codes by orders of magnitude.
  arXiv  Detail & Related papers  (2024-06-09T12:08:56Z)
• Learning Linear Block Error Correction Codes [62.25533750469467]
  We propose for the first time a unified encoder-decoder training of binary linear block codes. We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
  arXiv  Detail & Related papers  (2024-05-07T06:47:12Z)
• DoDo-Code: a Deep Levenshtein Distance Embedding-based Code for IDS Channel and DNA Storage [5.974644083956271]
  DoDo-Code is an IDS-correcting code that incorporates deep embedding of Levenshtein distance, deep embedding-based codeword search, and deep embedding-based segment correcting. DoDo-Code is the first IDS-correcting code designed using plausible deep learning methodologies.
  arXiv  Detail & Related papers  (2023-12-20T02:22:54Z)
• Delta Denoising Score [51.98288453616375]
  We introduce Delta Denoising Score (DDS), a novel scoring function for text-based image editing. It guides minimal modifications of an input image towards the content described in a target prompt.
  arXiv  Detail & Related papers  (2023-04-14T12:22:41Z)
• 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)
• Hybrid HMM Decoder For Convolutional Codes By Joint Trellis-Like Structure and Channel Prior [17.239378478086163]
  We propose the use of a Hidden Markov Model (HMM) for the reconstruction of convolutional codes and decoding by the Viterbi algorithm. Our method provides superior error correction potential than the standard method because the model parameters contain channel state information (CSI) In the multipath channel, the hybrid HMM decoder can achieve a performance gain of 4.7 dB and 2 dB when using hard-decision and soft-decision decoding.
  arXiv  Detail & Related papers  (2022-10-26T14:30:17Z)
• 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)
• FAID Diversity via Neural Networks [23.394836086114413]
  We propose a new approach to design the decoder diversity of finite alphabet iterative decoders (FAIDs) for Low-Density Parity Check (LDPC) codes. The proposed decoder diversity is achieved by training a recurrent quantized neural network (RQNN) to learn/design FAIDs.
  arXiv  Detail & Related papers  (2021-05-10T05:14:42Z)
• 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.