Diffusion Denoiser Achievable Analysis for Finite Blocklength Unsourced Random Access
Authors: Yuming Han, Yuxin Long
Organizations: Texas A&M University, Department of ECE, College Station, TX 77843, USA · University of Leeds, Institute for Transport Studies, Leeds, LS2 9JT, UK
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.5dB improvement in required Eb/N0 at a fixed error target.
Figures & tables
Figure 1: The required energy per bit to achieve ϵ=0.001 as a function of the number of active users for Theorem 1 and different achievable schemes.
Figure 2: The bounds on the probability of error ϵ as a function of Eb/N0 for Theorem 1 and different achievable schemes.
Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, BC V6T 1Z4, Canada · Nokia Bell Labs, 12 rue Jean Bart, 91300 Massy, France