R.I.P.
๐ป
Ghosted
Diffusion Denoiser Achievable Analysis for Finite Blocklength Unsourced Random Access
April 10, 2026 ยท Grace Period ยท + Add venue
Authors
Yuming Han, Yuxin Long
arXiv ID
2604.09904
Category
cs.IT: Information Theory
Cross-listed
cs.AI
Citations
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Information Theory
R.I.P.
๐ป
Ghosted
A Vision of 6G Wireless Systems: Applications, Trends, Technologies, and Open Research Problems
R.I.P.
๐ป
Ghosted
Towards Smart and Reconfigurable Environment: Intelligent Reflecting Surface Aided Wireless Network
๐
๐
The Cartographer
Wireless Communications with Unmanned Aerial Vehicles: Opportunities and Challenges
R.I.P.
๐ป
Ghosted
Reconfigurable Intelligent Surfaces for Energy Efficiency in Wireless Communication
๐
๐
The Cartographer