This paper studies the use of Blind Source Separation (BSS) as a replacement for Coded Random Access in diversity ALOHA massive machine-type communications. We propose a scheme for efficiently implementing BSS within the ALOHA framework, while also determining the number of active users in each slot. We experimentally evaluate the achievable performance and highlight the factors that influence the number of detectable users.
Blind Source Separation for ALOHA Massive Machine Type Communications
Michele Godeas;Alberto Carini
;Fulvio Babich
2025-01-01
Abstract
This paper studies the use of Blind Source Separation (BSS) as a replacement for Coded Random Access in diversity ALOHA massive machine-type communications. We propose a scheme for efficiently implementing BSS within the ALOHA framework, while also determining the number of active users in each slot. We experimentally evaluate the achievable performance and highlight the factors that influence the number of detectable users.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
