Zhang, Zhentian; An, Bo; Wong, Kai-Kit; Dang, Jian; Masouros, Christos; Zhang, Zaichen; Chae, Chan-Byoung; (2025) Coded Pattern Unsourced Random Access with Analyses on Sparse Pattern Demapper. IEEE Transactions on Wireless Communications 10.1109/twc.2025.3617544. (In press).

Preview

Text Paper-TW-Apr-25-0813.pdf - Accepted Version Download (976kB) | Preview

Abstract

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.

Download activity - last month

Export as CSVXMLJSON

Download activity - last 12 months

Export as JSONXMLCSV

Downloads by country - last 12 months

Export as JSONCSVXML

Archive Staff Only

View Item