Iterative Gaussian Approximation for Random Spreading Unsourced Random Access

TL;DR

This paper introduces an iterative Gaussian approximation decoder for random spreading unsourced random access, significantly improving decoding performance and robustness in massive machine-type communications.

Contribution

It presents a universal iterative decoding algorithm for RS-URA that converges quickly and enhances performance over existing methods.

Findings

Effective in improving decoding accuracy

Requires only a few iterations to converge

Validated through numerical simulations

Abstract

Massive machine-type communications (mMTC) demand robust solutions to support extensive connectivity efficiently. Unsourced random access (URA) has emerged as a promising approach, delivering high spectral and energy efficiency. Among URA code structures, the random spreading (RS) category is a key enabler, providing strong anti-interference capabilities through spectrum spreading gain. Notably, RS-URA approaches theoretical performance limits over the Gaussian multiple access channel in scenarios with few active users. In this paper, we propose an iterative Gaussian approximation decoder designed universally for RS-URA categories. The proposed receiver iterates extrinsic and intrinsic soft information to enhance decoding performance, requiring only a few iterations to converge. Numerical results validate the decoder's effectiveness in terms of performance and robustness.