Compressed sensing multi-user detection (CS-MUD) algorithms play a key role in optimizing grant-free (GF) non-orthogonal multiple access (NOMA) for massive machine-type communications (mMTC). However, current CS-MUD algorithms cannot be efficiently parallelized, leading to computationally expensive implementations of joint activity detection and channel estimation (JADCE) as the number of deployed machine-type devices (MTDs) increases. To address this, the present work proposes novel JADCE algorithms that can be applied in parallel for different clusters of MTDs by exploiting the structure of the pilot sequences. These are the approximation error method (AEM)-alternating direction method of multipliers (ADMM), and AEM-sparse Bayesian learning (SBL). Results presented in terms of the normalized mean square error and the probability of miss detection show comparable performance to the conventional algorithms. However, both AEM-ADMM and AEM-SBL algorithms have significantly reduced computational complexity and run times, thus, facilitating network scalability.
This paper considers joint user identification and channel estimation (JUICE) in grant-free access with a \emph{clustered} user activity pattern. In particular, we address the JUICE in massive machine-type communications (mMTC) network under correlated Rayleigh fading channels with unknown channel covariance matrices. We formulate the JUICE problem as a maximum \emph{a posteriori} probability (MAP) problem with properly chosen priors to incorporate the partial knowledge of the UEs' clustered activity and the unknown covariance matrices. We derive a computationally-efficient algorithm based on …
Caching at mobile devices and leveraging device-to-device (D2D) communication are two promising approaches to support massive content delivery over wireless networks. The analysis of such D2D caching networks based on a physical interference model is usually carried out by assuming that devices are uniformly distributed. However, this approach does not fully consider and characterize the fact that devices are usually grouped into clusters. Motivated by this fact, this paper presents a comprehensive performance analysis and joint communication and caching optimization for a clustered D2D networ…
Caching at mobile devices and leveraging device-to-device (D2D) communication are two promising approaches to support massive content delivery over wireless networks. Analysis of such D2D caching networks based on a physical interference model is usually carried out by assuming uniformly distributed devices. However, this approach does not capture the notion of device clustering. In this regard, this paper proposes a joint communication and caching optimization framework for clustered D2D networks. Devices are spatially distributed into disjoint clusters and are assumed to have a surplus memor…
One basic operation of Internet-of-Things (IoT) networks is aggregating distributed sensing-data over wireless-channels for function-computation, called wireless-data-aggregation (WDA). Targeting dense sensors, a recently developed technology called over-the-air computing (AirComp) can dramatically reduce the WDA latency by aggregating distributed data "over-the-air" using the waveform-superposition property of a multi-access channel. In this work, we design multiple-input-multiple-output (MIMO) AirComp for computing a vector-valued function in a clustered IoT network with multi-antenna sensor…
Grant-free non-orthogonal multiple access (NOMA) is considered as one of the supporting technology for massive connectivity for future networks. In the grant-free NOMA systems with a massive number of users, user activity detection is of great importance. Existing multi-user detection (MUD) techniques rely on complicated update steps which may cause latency in signal detection. In this paper, we propose a generative neural network-based MUD (GenMUD) framework to utilize low-complexity neural networks, which are trained to reconstruct signals in a small fixed number of steps. By exploiting the …
Internet of Things (IoT) has triggered a rapid increase in the number of connected devices and new use cases of wireless communications. To meet the new demands, the fifth generation (5G) of wireless communication systems features native machine type communication (MTC) services in addition to traditional human type communication (HTC) services. Some of the main challenges are the heterogeneous requirements and the sporadic traffic of massive MTC (mMTC), which makes the orthogonal allocation of resources infeasible. To overcome this problem, grant free non-orthogonal multiple access schemes ha…
Joint Activity Detection and Channel Estimation for Massive Connectivity: Where Message Passing Meets Score-Based Generative Priors
The University of Hong Kong（香港大学）；National Key Laboratory of Wireless Communications, University of Electronic Science and Technology of China（电子科技大学无线通信国家重点实验室）；The Chinese University of Hong Kong（香港中文大学）
Pain and physical function are both essential indices of recovery in critically ill patients in the Intensive Care Units (ICU). Simultaneous monitoring of pain intensity and patient activity can be important for determining which analgesic interventions can optimize mobility and function, while minimizing opioid harm. Nonetheless, so far, our knowledge of the relation between pain and activity has been limited to manual and sporadic activity assessments. In recent years, wearable devices equipped with 3-axis accelerometers have been used in many domains to provide a continuous and automated me…
Intelligent Reflecting Surface (IRS) has been a promising solution to enhance wireless networks both spectral-efficiently and energy-efficiently. This paper considers an IRS-assisted the Internet of Things network for massive connectivity. We aim to solve the IRS-related activity detection and channel estimation problem which has not been studied before. In this paper, we formulate the IRS-related activity detection and channel estimation problem as sparse matrix factorization, matrix completion and Multiple Measurement Vector problem and, we propose a three-stage framework based on the approx…
Device activity detection is one main challenge in grant-free massive access, which is recently proposed to support massive machine-type communications (mMTC). Existing solutions for device activity detection fail to consider inter-cell interference generated by massive IoT devices or important prior information on device activities and inter-cell interference. In this paper, given different numbers of observations and network parameters, we consider both non-cooperative device activity detection and cooperative device activity detection in a multi-cell network, consisting of many access point…
In this paper, we propose a turbo receiver for joint activity detection and data decoding in grant-free massive random access, which iterates between a detector and a belief propagation (BP)-based channel decoder. Specifically, responsible for user activity detection, channel estimation, and soft data symbol detection, the detector is developed based on a bilinear inference problem that exploits the common sparsity pattern in the received pilot and data signals. The bilinear generalized approximate message passing (BiG-AMP) algorithm is adopted to solve the problem using probabilities of the t…
ShanghaiTech University（上海科技大学）；Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences（中国科学院上海微系统与信息技术研究所）；University of Chinese Academy of Sciences（中国科学院大学）
Joint activity detection and channel estimation (JADCE) for grant-free random access is a critical issue that needs to be addressed to support massive connectivity in IoT networks. However, the existing model-free learning method can only achieve either activity detection or channel estimation, but not both. In this paper, we propose a novel model-free learning method based on generative adversarial network (GAN) to tackle the JADCE problem. We adopt the U-net architecture to build the generator rather than the standard GAN architecture, where a pre-estimated value that contains the activity i…
In this letter, we study the joint device activity and delay detection problem in asynchronous massive machine-type communications (mMTC), where all active devices asynchronously transmit their preassigned preamble sequences to the base station (BS) for device identification and delay detection. We first formulate this joint detection problem as a maximum likelihood estimation problem, which depends on the received signal only through its sample covariance, and then propose efficient coordinate descent type of algorithms to solve the formulated problem. Our proposed covariance-based approach i…
In this work, based on the hybrid generalized approximate message passing (HyGAMP) algorithm, we propose the message-scheduling GAMP (MSGAMP) algorithm in order to address the problem of joint active device detection and channel estimation in an uplink grant-free massive MIMO system scenario. In MSGAMP, we apply three different scheduling techniques based on the Residual Belief Propagation (RBP) in which messages are generated using the latest available information. With a much lower computational cost than the state-of-the-art algorithms, MSGAMP-type schemes exhibits good performance in terms…
Millimeter-wave/Terahertz (mmW/THz) communications have shown great potential for wideband massive access in next-generation cellular internet of things (IoT) networks. To decrease the length of pilot sequences and the computational complexity in wideband massive access, this paper proposes a novel joint activity detection and channel estimation (JADCE) algorithm. Specifically, after formulating JADCE as a problem of recovering a simultaneously sparse-group and low rank matrix according to the characteristics of mmW/THz channel, we prove that jointly imposing $l_1$ norm and low rank on such a …
This paper studies the user activity detection and channel estimation problem in a temporally-correlated massive access system where a very large number of users communicate with a base station sporadically and each user once activated can transmit with a large probability over multiple consecutive frames. We formulate the problem as a dynamic compressed sensing (DCS) problem to exploit both the sparsity and the temporal correlation of user activity. By leveraging the hybrid generalized approximate message passing (HyGAMP) framework, we design a computationally efficient algorithm, HyGAMP-DCS,…
Tailor-made for massive connectivity and sporadic access, grant-free random access has become a promising candidate access protocol for massive machine-type communications (mMTC). Compared with conventional grant-based protocols, grant-free random access skips the exchange of scheduling information to reduce the signaling overhead, and facilitates sharing of access resources to enhance access efficiency. However, some challenges remain to be addressed in the receiver design, such as unknown identity of active users and multi-user interference (MUI) on shared access resources. In this work, we …
Faced with the massive connection, sporadic transmission, and small-sized data packets in future cellular communication, a grant-free non-orthogonal random access (NORA) system is considered in this paper, which could reduce the access delay and support more devices. In order to address the joint user activity detection (UAD) and channel estimation (CE) problem in the grant-free NORA system, we propose a deep neural network-aided message passing-based block sparse Bayesian learning (DNN-MP-BSBL) algorithm. In this algorithm, the message passing process is transferred from a factor graph to a d…
Structured-Sparsity-Aware Joint User Activity Detection and Channel Estimation for OTFS-Based Grant-Free Random Access
Nanyang Technological University（南洋理工大学）；State Key Laboratory of Integrated Services Networks, Xidian University（西安电子科技大学集成服务网络国家重点实验室）；AUMOVIO Germany GmbH（奥莫维欧德国有限公司）；University of California at Davis（加州大学戴维斯分校）
In this letter, we propose a joint active device detection and channel estimation framework based on factor graphs for asynchronous uplink grant-free massive multiple-antenna systems. We then develop the message-scheduling GAMP (MSGAMP) algorithm to perform joint active device detection and channel estimation. In MSGAMP we apply scheduling techniques based on the residual belief propagation (RBP) and the activity user detection (AUD) in which messages are generated using the latest available information. MSGAMP-type schemes show a good performance in terms of activity error rate and normalized…
Grant-free non-coherent index-modulation (NC-IM) has been recently considered as an efficient massive access scheme for enabling cost- and energy-limited Internet-of-Things (IoT) devices that transmit small data packets. This paper investigates the grant-free NC-IM scheme combined with orthogonal frequency division multiplexing for applicant to unmanned aerial vehicle (UAV)-based massive IoT access. Specifically, each device is assigned a unique non-orthogonal signature sequence codebook. Each active device transmits one of its signature sequences in the given time-frequency resources, by modu…
This paper proposes a computationally efficient algorithm to solve the joint data and activity detection problem for massive random access with massive multiple-input multiple-output (MIMO). The BS acquires the active devices and their data by detecting the transmitted preassigned nonorthogonal signature sequences. This paper employs a covariance based approach that formulates the detection problem as a maximum likelihood estimation (MLE) problem. To efficiently solve the problem, this paper designs a novel iterative algorithm with low complexity in the regime where the device activity pattern…
In this paper, we investigate jointly sparse signal recovery and jointly sparse support recovery in Multiple Measurement Vector (MMV) models for complex signals, which arise in many applications in communications and signal processing. Recent key applications include channel estimation and device activity detection in MIMO-based grant-free random access which is proposed to support massive machine-type communications (mMTC) for Internet of Things (IoT). Utilizing techniques in compressive sensing, optimization and deep learning, we propose two model-driven approaches, based on the standard aut…
Grant-free random access is a promising protocol to support massive access in beyond fifth-generation (B5G) cellular Internet-of-Things (IoT) with sporadic traffic. Specifically, in each coherence interval, the base station (BS) performs joint activity detection and channel estimation (JADCE) before data transmission. Due to the deployment of a large-scale antennas array and the existence of a huge number of IoT devices, JADCE usually has high computational complexity and needs long pilot sequences. To solve these challenges, this paper proposes a dimension reduction method, which projects the…
Through-the-Wall Radar Human Activity Micro-Doppler Signature Representation Method Based on Joint Boulic-Sinusoidal Pendulum Model
School of Information and Electronics, Beijing Institute of Technology（北京理工大学信息与电子学院）；Jiaxing Research Center of Beijing Institute of Technology（北京理工大学嘉兴研究院）；Key Laboratory of Electronic and Information Technology in Satellite Navigation, Beijing Institute of Technology（北京理工大学卫星导航电子信息技术重点实验室）
Cell-free massive MIMO is one of the key technologies for future wireless communications, in which users are simultaneously and jointly served by all access points (APs). In this paper, we investigate the minimum mean square error (MMSE) estimation of effective channel coefficients in cell-free massive MIMO systems with massive connectivity. To facilitate the theoretical analysis, only single measurement vector (SMV) based MMSE estimation is considered in this paper, i.e., the MMSE estimation is performed based on the received pilot signals at each AP separately. Inspired by the decoupling pri…
