Activity Detection for Massive Random Access Using Covariance-Based Matching Pursuit
Marata, Leatile; Ollila, Esa; Alves, Hirley (2025-05-28)
Marata, Leatile
Ollila, Esa
Alves, Hirley
IEEE
28.05.2025
L. Marata, E. Ollila and H. Alves, "Activity Detection for Massive Random Access Using Covariance-Based Matching Pursuit," in IEEE Transactions on Vehicular Technology, doi: 10.1109/TVT.2025.3574551
https://creativecommons.org/licenses/by/4.0/
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
https://creativecommons.org/licenses/by/4.0/
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
https://creativecommons.org/licenses/by/4.0/
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:oulu-202506244940
https://urn.fi/URN:NBN:fi:oulu-202506244940
Tiivistelmä
Abstract
The Internet of Things paradigm heavily relies on a network of a massive number of machine -type devices (MTDs) that monitor various phenomena. Consequently, MTDs are randomly activated at different times whenever a change occurs. In general, fewer MTDs are simultaneously activated across the network, resembling targeted sampling in compressed sensing. Therefore, signal recovery in machine -type communications is addressed through joint user activity detection and channel estimation algorithms built using compressed sensing theory. However, most of these algorithms follow a two-stage procedure in which a channel is first estimated and later mapped to find active users. This approach is inefficient because the estimated channel information is subsequently discarded. To overcome this limitation, we introduce a novel covariance-learning matching pursuit (CL-MP) algorithm that bypasses explicit channel estimation. Instead, it focuses on estimating the indices of the active users greedily. Simulation results presented in terms of probability of misdetection, exact recovery rate, computational complexity and runtimes validate the proposed technique's superior performance and efficiency.
The Internet of Things paradigm heavily relies on a network of a massive number of machine -type devices (MTDs) that monitor various phenomena. Consequently, MTDs are randomly activated at different times whenever a change occurs. In general, fewer MTDs are simultaneously activated across the network, resembling targeted sampling in compressed sensing. Therefore, signal recovery in machine -type communications is addressed through joint user activity detection and channel estimation algorithms built using compressed sensing theory. However, most of these algorithms follow a two-stage procedure in which a channel is first estimated and later mapped to find active users. This approach is inefficient because the estimated channel information is subsequently discarded. To overcome this limitation, we introduce a novel covariance-learning matching pursuit (CL-MP) algorithm that bypasses explicit channel estimation. Instead, it focuses on estimating the indices of the active users greedily. Simulation results presented in terms of probability of misdetection, exact recovery rate, computational complexity and runtimes validate the proposed technique's superior performance and efficiency.
Kokoelmat
- Avoin saatavuus [38841]