Blind Grant-Free Random Access with Message Passing Based Matrix Factorization in mmWave MIMO mMTC
Publication Name
IEEE Internet of Things Journal
Abstract
Grant-free random access is promising in achieving massive connectivity with sporadic transmissions in massive machine type communications (mMTC) for internet of things (IoT) applications, where the hand-shaking between the access point (AP) and users is skipped, leading to high multiple access efficiency. In grant-free random access, the AP needs to identify the active users and perform channel estimation and signal detection. Conventionally, pilot signals are required for the AP to achieve user activity detection and channel estimation before active user signal detection, which may still result in substantial overhead and latency. In this paper, to further reduce the overhead and latency, we investigate the problem of grant-free random access without the use of pilot signals in a millimeter wave (mmWave) multiple input and multiple output (MIMO) system, where the AP performs blind joint user activity detection, channel estimation and signal detection (UACESD). We show that the blind joint UACESD can be formulated as a constrained composite matrix factorization problem, which can be solved by exploiting the structures of the channel matrix and signal matrix. Leveraging a unitary approximate message passing based matrix factorization (UAMPMF) algorithm, we design a message passing based Bayesian algorithm to solve the blind joint UACESD problem. Extensive simulation results demonstrate the effectiveness of the blind grantfree random access scheme.
Open Access Status
This publication is not available as open access