TY - GEN
T1 - Multi-Class Unsourced Random Access via Coded Demixing
AU - Amalladinne, Vamsi K.
AU - Hao, Allen
AU - Rini, Stefano
AU - Chamberland, Jean Francois
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021/7/12
Y1 - 2021/7/12
N2 - 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.
AB - 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.
KW - approximate message passing
KW - coded compressed sensing
KW - compressive demixing
KW - Unsourced random access
UR - http://www.scopus.com/inward/record.url?scp=85115055416&partnerID=8YFLogxK
U2 - 10.1109/ISIT45174.2021.9517816
DO - 10.1109/ISIT45174.2021.9517816
M3 - Conference contribution
AN - SCOPUS:85115055416
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 3080
EP - 3085
BT - 2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2021 IEEE International Symposium on Information Theory, ISIT 2021
Y2 - 12 July 2021 through 20 July 2021
ER -