Research
Diffusion Denoiser Achievable Analysis for Finite Blocklength Unsourced Random Access
arXiv:2604.09904v1 Announce Type: cross Abstract: Polyanskiy proposed a framework for the unsourced multiple access channel (MAC) problem where users employ a common codebook in the finite blocklength
arXiv:2604.09904v1 Announce Type: cross 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 dB improvement in required E_b/N_0 at a fixed error target.
Related
- Continuous-time Online Learning via Mean-Field Neural Networks: Regret Analysis in Diffusion Environments
- Rethinking the Diffusion Model from a Langevin Perspective
Source: arXiv cs.AI | 2026-04-14