mlsanityData to 14 Oct 2026

Diffusion Denoiser Achievable Analysis for Finite Blocklength Unsourced Random Access

arXiv 2604.09904 ↗First posted 10 Apr 2026cs.IT cs.AI math.ITcited by 0

Not on the map. Why?

Abstract (arXiv)

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 dB improvement in required Eb/N0 at a fixed error target.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 18 references that are in the map. First posted on arXiv 10 Apr 2026.

Builds on

3 of 18 references.

References · 3

  1. 2023CDDM: Channel Denoising Diffusion Models for Wireless Semantic Communicationscited by 59
  2. 2022Denoising Diffusion Error Correction Codescited by 24
  3. 2020Massive Unsourced Random Access Based on Uncoupled Compressive Sensing: Another Blessing of Massive MIMOcited by 1

Built on by

Not cited yet.