Multi-Class Unsourced Random Access via Coded Demixing

Vamsi K. Amalladinne, Allen Hao, Stefano Rini, Jean Francois Chamberland

研究成果: Conference contribution同行評審

1 引文 斯高帕斯(Scopus)

摘要

Unsourced random access (URA) is a recently proposed communication paradigm attuned to machine-driven data transfers. In the original URA formulation, all the active devices share the same number of bits per packet. The scenario where several classes of devices transmit concurrently has so far received little attention. An initial solution to this problem takes the form of group successive interference cancellation, where codewords from a class of devices with more resources are recovered first, followed by the decoding of the remaining messages. This article introduces a joint iterative decoding approach rooted in approximate message passing. This framework has a concatenated coding structure borrowed from the single-class coded compressed sensing and admits a solution that offers performance improvement at little added computational complexity. Our findings point to new connections between multiclass URA and compressive demixing. The performance of the envisioned algorithm is validated through numerical simulations.

原文English
主出版物標題2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings
發行者Institute of Electrical and Electronics Engineers Inc.
頁面3080-3085
頁數6
ISBN(電子)9781538682098
DOIs
出版狀態Published - 12 7月 2021
事件2021 IEEE International Symposium on Information Theory, ISIT 2021 - Virtual, Melbourne, 澳大利亞
持續時間: 12 7月 202120 7月 2021

出版系列

名字IEEE International Symposium on Information Theory - Proceedings
2021-July
ISSN(列印)2157-8095

Conference

Conference2021 IEEE International Symposium on Information Theory, ISIT 2021
國家/地區澳大利亞
城市Virtual, Melbourne
期間12/07/2120/07/21

指紋

深入研究「Multi-Class Unsourced Random Access via Coded Demixing」主題。共同形成了獨特的指紋。

引用此