A Flexible Framework for Grant-Free Random Access in Cell-Free Massive MIMO Systems
We propose a novel generalized framework for grant-free random-access (GFRA) in cell-free massive multiple input multiple-output systems where multiple geographically separated access points (APs) or base stations (BSs) aim to detect sporadically active user-equipment (UEs). Unlike a conventional architecture in which all the active UEs transmit their signature or pilot sequences of equal length, we admit a flexible pilot length for each UE, which also enables a seamless integration into conventional grant-based wireless systems. We formulate the joint UE activity detection and the distributed channel estimation as a sparse support and signal recovery problem, and describe a Bayesian learning procedure to solve it. We develop a scheme to fuse the posterior statistics of the latent variables inferred by each AP to jointly detect the UEs' activities, and utilize them to further refine the channel estimates. In addition, we allude to an interesting point which enables this flexible GFRA framework to encode the information bits from the active UEs. We numerically evaluate the normalized mean square error and the probability of miss-detection performances obtained by the Bayesian algorithm and show that the latent-variable fusion enhances the detection and the channel estimation performances by a large margin. We also benchmark against a genie-aided algorithm which has a prior knowledge of the UEs' activities.
Code (0)
등록된 구현이 없습니다.
Tasks
Action DetectionActivity DetectionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Variational Bayesian Inference Clustering Based Joint User Activity and Data Detection for Grant-Free Random Access in mMTC
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 p…
Bayesian InferenceClusteringSchedulingPrecise Analysis of Covariance Identifiability for Activity Detection in Grant-Free Random Access
We consider the identifiability issue of maximum likelihood based activity detection in massive MIMO based grant-free random access. A prior work by Chen et al. indicates that the identifiability undergoes a phase transi…
Action DetectionActivity DetectionGrant-Free Random Access in Massive MIMO for Static Low-Power IoT Nodes
Massive MIMO is a promising technology to enable a massive number of Internet of Things nodes to transmit short and sporadic data bursts at low power. In conventional cellular networks, devices use a grant-based random a…
Grant-free Massive Random Access with Retransmission: Receiver Optimization and Performance Analysis
There is an increasing demand of massive machine-type communication (mMTC) to provide scalable access for a large number of devices, which has prompted extensive investigation on grant-free massive random access (RA) in …
Action DetectionActivity DetectionA Grant-based Random Access Protocol in Extra-Large Massive MIMO System
Extra-large massive multiple-input multiple-output (XL-MIMO) systems is a new concept, where spatial non-stationarities allow activate a high number of user equipments (UEs). This paper focuses on a grant-based random ac…