Activity detection is an important task in the next generation grant-free multiple access. While there are a number of existing algorithms designed for this purpose, they mostly require precise information about the network, such as large-scale fading coefficients, small-scale fading channel statistics, noise variance at the access points, and user activity probability. Acquiring these information would take a significant overhead and their estimated values might not be accurate. This problem is even more severe in cell-free networks as there are many of these parameters to be acquired. Therefore, this paper sets out to investigate the activity detection problem without the above-mentioned information. In order to handle so many unknown parameters, this paper employs the Bayesian approach, where the unknown variables are endowed with prior distributions which effectively act as regularizations. Together with the likelihood function, a maximum a posteriori (MAP) estimator and a variational inference algorithm are derived. Extensive simulations demonstrate that the proposed methods, even without the knowledge of these system parameters, perform better than existing state-of-the-art methods, such as covariance-based and approximate message passing methods.
10 July 2025 in IEEE Transactions on Signal Processing
Joint activity detection and channel estimation present significant challenges in massive machine-type communication under grant-free random access. Due to the intermittency of grant-free random access, these tasks can be framed as a compressive sensing problem, where approximate message passing (AMP) has been a popular algorithm to recover the sparse channels. However, existing AMP-based algorithms typically estimate the channels at each antenna independently, largely ignoring the common sparsity support among channels at different antennas and access points. This oversight leads to inadequate performance of AMP-based activity detection and channel estimation, especially under short pilot sequence lengths. To leverage the common sparsity patterns of multiple unknown channel vectors, this paper proposes a Bayesian model that induces block sparsity through a consistent activity status across all channels associated with each device. By treating the activity probability of each device as an unknown parameter, this paper derives an AMP-based expectation-maximization (EM) algorithm to jointly learn the activity probability and the channels. It is shown theoretically that under mild conditions, when the number of antennas goes to infinity, the recovered active status is guaranteed to be the ground truth. Furthermore, to overcome the limitation of the standard AMP, whose convergence to the state evolution relies on large pilot sequence lengths, another algorithm based on the vector AMP, with its convergence depending on the number of devices rather than pilot sequence length, is also proposed. Simulation results demonstrate that the proposed algorithms require a much shorter pilot length than existing state-of- the-art AMP-based methods to achieve the same performance. Notably, under the same pilot length, the vector AMP-based EM algorithm achieves even higher detection accuracy than the covariance-based method in cell-free systems.
23 December 2025 in IEEE Transactions on Communications
Joint activity detection and channel estimation is a crucial task in grant-free random access for massive machine-type communications. To enhance communication quality, intelligent reflecting surfaces (IRSs) have been proposed as a promising technology by controlling the propagation environment with passive reflecting elements. However, due to their passive nature and the non-Gaussian device-IRS-BS composite channels, IRSs introduce significant challenges for joint activity detection and channel estimation. To this end, this paper establishes an accurate statistical model for the composite channel, demonstrating that it follows a variance-gamma (VG) distribution. Based on the exact channel statistics, this paper employs a Bernoulli-VG prior and extends the standard approximate message passing algorithm to learn the Gamma-distributed channel variance within an expectation-maximization framework. Additionally, this paper introduces a novel approach to enforce consistency in device activity status across all base station antennas by transforming the activity detection task into the estimation of a dedicated active probability for each device. Extensive simulations validate the proposed VG channel model and demonstrate significant improvement due to imposing consistent activity probability across multiple antennas.