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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE communications letters Ročník 29; číslo 4; s. 829 - 833
Hlavní autoři: Dang, Jian, Zhang, Zaichen, Wu, Yongpeng
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.04.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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