Return
Coded Pattern Unsourced Random Access With Analyses on Sparse Pattern Demapper
DOI:10.1109/twc.2025.3617544.png)
Abstract
En 中文
In this paper, we introduce a novel framework for multiple access code design under the finite blocklength regime in multi-input and multi-output (MIMO) systems, termed coded pattern multiple access (CPMA). CPMA involves a series of multiple access code designs facilitated by a sparse pattern mapper/demapper, enabling independent information projection onto transmission patterns. Unlike existing approaches, the mapping and demapping of patterns are completely isolated components, ensuring energy-efficient transmission. In this work, we establish and analyze practical CPMA models, thoroughly investigating the performance limits of a potential non-bijective demapper. Closed-form and integral-form solutions are provided to describe these performance limits. Additionally, we present a practical application of CPMA: the coded pattern unsourced random access (CPURA) scheme. This scheme is designed for finite blocklength transmission under a quasi-static fading channel. The proposed CPURA achieves bound-approaching performance for large user groups, outperforming existing state-of-the-art methods in the context of massive machine-type communications (mMTC). Notably, the minimum required energy-per-bit to support 1,200 active users exhibits only a 1.3 dB gap from the achievable bound, validating the potential of the proposed CPMA framework.
Journal
IF:
10.7
Papers:
1.4W
Citations:
7.1W

