Random Spreading With Higher Order Modulation in Unsourced Random Access

Unsourced random access (URA) is crucial for future massive access scenarios. Existing URA schemes often use low-order modulation and assess performance with a limited number of active users. This work presents a pilot-free URA scheme that employs random spreading and higher-order modulation. We der...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters Vol. 29; no. 4; pp. 829 - 833
Main Authors: Dang, Jian, Zhang, Zaichen, Wu, Yongpeng
Format: Journal Article
Language:English
Published: New York IEEE 01.04.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
active user detection
Adaptation models
Algorithms
Approximation algorithms
Decoding
Indexes
Mathematical models
Message passing
Modulation
multiple access
Random access
random spreading
Symbols
Unsourced random access
Vectors
ISSN:1089-7798, 1558-2558
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Unsourced random access (URA) is crucial for future massive access scenarios. Existing URA schemes often use low-order modulation and assess performance with a limited number of active users. This work presents a pilot-free URA scheme that employs random spreading and higher-order modulation. We derive a discrete mixture generalized approximate message passing algorithm to enhance active user detection (AUD) and data detection. Simulations show that our proposed method significantly outperforms pilot-based methods in AUD, and higher-order modulation supports a large number of active users while ensuring the target per user probability of error (PUPE) performance.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2025.3544250