Diffusion Denoiser Achievable Analysis for Finite Blocklength Unsourced Random Access
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913022292787200 |
|---|---|
| author | Han, Yuming Long, Yuxin |
| author_facet | Han, Yuming Long, Yuxin |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_09904 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Diffusion Denoiser Achievable Analysis for Finite Blocklength Unsourced Random Access Han, Yuming Long, Yuxin Information Theory Artificial Intelligence 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. |
| title | Diffusion Denoiser Achievable Analysis for Finite Blocklength Unsourced Random Access |
| topic | Information Theory Artificial Intelligence |
| url | https://arxiv.org/abs/2604.09904 |