Diffusion Denoiser Achievable Analysis for Finite Blocklength Unsourced Random Access

• URL: http://arxiv.org/abs/2604.09904v1
• Date: Fri, 10 Apr 2026 20:58:27 GMT
• Title: Diffusion Denoiser Achievable Analysis for Finite Blocklength Unsourced Random Access
• Abstract summary: We introduce a decoder compatible diffusion denoiser as a lightweight analysis within joint decoding.<n>The score network is trained on samples drawn from the channel output distribution, making the method easy to integrate with existing code designs.
• Score: 0.5672132510411464
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Polyanskiy proposed a framework for the unsourced multiple access channel (MAC) problem where users employ a common codebook in the finite blocklength regime. However, existing approaches handle channel noise before the joint decoder. In this work, we introduce a decoder compatible diffusion denoiser as a lightweight analysis within joint decoding. The score network is trained on samples drawn from the channel output distribution, making the method easy to integrate with existing code designs. In our theoretical analysis, we derive a diffusion-denoiser random-coding achievable bound that is strictly tighter. Simulations on existing decoders, including FASURA, MSUG-MRA and pilot-based method, show consistent performance gains with at least a $0.5$ $\mathrm{dB}$ improvement in required $\mathrm{E_b/N_0}$ at a fixed error target.

Related papers

• Proof of a finite threshold for the union-find decoder [0.9558392439655014]
  We provide a proof of a finite threshold for the union-find (UF) decoder on the surface code under the circuit-level local error model.<n>We also show that this framework yields a finite threshold for the greedy decoder, a simpler decoder with lower complexity but weaker empirical error suppression.<n>These results provide a solid theoretical foundation for the practical use of UF-based decoders in the development of fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2026-02-23T19:00:00Z)
• Land-then-transport: A Flow Matching-Based Generative Decoder for Wireless Image Transmission [38.71668959954467]
  We propose a flow-matching generative decoder for low-latency decoding.<n>Experiments show consistent gains over JPEG2000+LDPC, DeepJSCC, and diffusion-based baselines.<n> LTT provides a deterministic, physically interpretable, and efficient framework for generative wireless image decoding.
  arXiv  Detail & Related papers  (2026-01-12T13:09:37Z)
• Adversarial Jamming for Autoencoder Distribution Matching [45.91787704667618]
  We propose the use of adversarial wireless jamming to regularise the latent space of an autoencoder.<n>We achieve distribution matching comparable to standard variational autoencoders and to Wasserstein autoencoders.
  arXiv  Detail & Related papers  (2025-12-02T13:23:25Z)
• MaskPro: Linear-Space Probabilistic Learning for Strict (N:M)-Sparsity on Large Language Models [53.36415620647177]
  Semi-structured sparsity offers a promising solution by strategically retaining $N$ elements out of every $M$ weights.<n>Existing (N:M)-compatible approaches typically fall into two categories: rule-based layerwise greedy search, which suffers from considerable errors, and gradient-driven learning, which incurs prohibitive training costs.<n>We propose a novel linear-space probabilistic framework named MaskPro, which aims to learn a prior categorical distribution for every $M$ consecutive weights and subsequently leverages this distribution to generate the (N:M)-sparsity throughout an $N$-way sampling
  arXiv  Detail & Related papers  (2025-06-15T15:02:59Z)
• I Think, Therefore I Diffuse: Enabling Multimodal In-Context Reasoning in Diffusion Models [50.34197948438868]
  ThinkDiff is an alignment paradigm that empowers text-to-image diffusion models with multimodal in-context understanding and reasoning capabilities.<n>We show that ThinkDiff significantly improves accuracy from 19.2% to 46.3% on the challenging CoBSAT benchmark for multimodal in-context reasoning generation.<n>We also demonstrate exceptional performance in composing multiple images and texts into logically coherent images.
  arXiv  Detail & Related papers  (2025-02-12T05:30:08Z)
• Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency [52.60557300927007]
  We present a $textbfMA-OSMA$ algorithm to transfer the discrete submodular problem into a continuous optimization.<n>We also introduce a projection-free $textbfMA-OSEA$ algorithm, which effectively utilizes the KL divergence by mixing a uniform distribution.<n>Our algorithms significantly improve the $(frac11+c)$-approximation provided by the state-of-the-art OSG algorithm.
  arXiv  Detail & Related papers  (2025-02-07T15:57:56Z)
• Estimating the Decoding Failure Rate of Binary Regular Codes Using Iterative Decoding [84.0257274213152]
  We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder.<n>We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
  arXiv  Detail & Related papers  (2024-01-30T11:40:24Z)
• Variational Diffusion Auto-encoder: Latent Space Extraction from Pre-trained Diffusion Models [0.0]
  Variational Auto-Encoders (VAEs) face challenges with the quality of generated images, often presenting noticeable blurriness. This issue stems from the unrealistic assumption that approximates the conditional data distribution, $p(textbfx | textbfz)$, as an isotropic Gaussian. We illustrate how one can extract a latent space from a pre-existing diffusion model by optimizing an encoder to maximize the marginal data log-likelihood.
  arXiv  Detail & Related papers  (2023-04-24T14:44:47Z)
• Machine Learning-Aided Efficient Decoding of Reed-Muller Subcodes [59.55193427277134]
  Reed-Muller (RM) codes achieve the capacity of general binary-input memoryless symmetric channels. RM codes only admit limited sets of rates. Efficient decoders are available for RM codes at finite lengths.
  arXiv  Detail & Related papers  (2023-01-16T04:11:14Z)
• Low PAPR MIMO-OFDM Design Based on Convolutional Autoencoder [20.544993155126967]
  A new framework for peak-to-average power ratio ($mathsfPAPR$) reduction and waveform design is presented. A convolutional-autoencoder ($mathsfCAE$) architecture is presented. We show that a single trained model covers the tasks of $mathsfPAPR$ reduction, spectrum design, and $mathsfMIMO$ detection together over a wide range of SNR levels.
  arXiv  Detail & Related papers  (2023-01-11T11:35:10Z)
• 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)

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.