Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userJoint Active User Detection and Channel Estimation in Massive Access Systems Exploiting Reed-Muller Sequences
141
0
0.0
(
0
)
Added by
Zhaoyang Zhang
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
The requirements to support massive connectivity and low latency in massive Machine Type Communications (mMTC) bring a huge challenge in the design of its random access (RA) procedure, which usually calls for efficient joint active user detection and channel estimation. In this paper, we exploit the vast sequence space and the beneficial nested structure of the length-$2^m$ second-order Reed-Muller (RM) sequences for designing an efficient RA scheme, which is capable of reliably detecting multiple active users from the set of unknown potential users with a size as large as $2^{m(m-1)/2}$, whilst simultaneously estimating their channel state information as well. Explicitly, at the transmitter each user is mapped to a specially designed RM sequence, which facilitates reliable joint sequence detection and channel estimation based on a single transmission event. To elaborate, as a first step, at the receiver we exploit the elegant nested structure of the RM sequences using a layer-by-layer RM detection algorithm for the single-user (single-sequence) scenario. Then an iterative RM detection and channel estimation algorithm is conceived for the multi-user (multi-sequence) scenario. As a benefit of the information exchange between the RM sequence detector and channel estimator, a compelling performance vs. complexity trade-off is struck, as evidenced both by our analytical and numerical results.
rate research
Read More
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 matrix can achieve a robust recovery under sufficient conditions, and verify that the number of measurements derived for the mmW/THz wideband massive access system is significantly smaller than currently known measurements bound derived for the conventional simultaneously sparse and low-rank recovery. Furthermore, we propose a multi-rank aware method by exploiting the quotient geometry of product of complex rank-$L$ matrices with the number of scattering clusters $L$. Theoretical analysis and simulation results confirm the superiority of the proposed algorithm in terms of computational complexity, detection error rate, and channel estimation accuracy.
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 original device state matrix to a low-dimensional space by exploiting its sparse and low-rank structure. Then, we develop an optimized design framework with a coupled full column rank constraint for JADCE to reduce the size of the search space. However, the resulting problem is non-convex and highly intractable, for which the conventional convex relaxation approaches are inapplicable. To this end, we propose a logarithmic smoothing method for the non-smoothed objective function and transform the interested matrix to a positive semidefinite matrix, followed by giving a Riemannian trust-region algorithm to solve the problem in complex field. Simulation results show that the proposed algorithm is efficient to a large-scale JADCE problem and requires shorter pilot sequences than the state-of-art algorithms which only exploit the sparsity of device state matrix.
In this paper, we address the message-passing receiver design for the 3D massive MIMO-OFDM systems. With the aid of the central limit argument and Taylor-series approximation, a computationally efficient receiver that performs joint channel estimation and decoding is devised by the framework of expectation propagation. Specially, the local belief defined at the channel transition function is expanded up to the second order with Wirtinger calculus, to transform the messages sent by the channel transition function to a tractable form. As a result, the channel impulse response (CIR) between each pair of antennas is estimated by Gaussian message passing. In addition, a variational expectation-maximization (EM)-based method is derived to learn the channel power-delay-profile (PDP). The proposed joint algorithm is assessed in 3D massive MIMO systems with spatially correlated channels, and the empirical results corroborate its superiority in terms of performance and complexity.
Reconfigurable Intelligent Surfaces (RISs) have been recently considered as an energy-efficient solution for future wireless networks. Their dynamic and low-power configuration enables coverage extension, massive connectivity, and low-latency communications. Channel estimation and signal recovery in RISbased systems are among the most critical technical challenges, due to the large number of unknown variables referring to the RIS unit elements and the transmitted signals. In this paper, we focus on the downlink of a RIS-assisted multi-user Multiple Input Single Output (MISO) communication system and present a joint channel estimation and signal recovery scheme based on the PARAllel FACtor (PARAFAC) decomposition. This decomposition unfolds the cascaded channel model and facilitates signal recovery using the Bilinear Generalized Approximate Message Passing (BiG-AMP) algorithm. The proposed method includes an alternating least squares algorithm to iteratively estimate the equivalent matrix, which consists of the transmitted signals and the channels between the base station and RIS, as well as the channels between the RIS and the multiple users. Our selective simulation results show that the proposed scheme outperforms a benchmark scheme that uses genie-aided information knowledge. We also provide insights on the impact of different RIS parameter settings on the proposed scheme.
This paper addresses the problem of joint downlink channel estimation and user grouping in massive multiple-input multiple-output (MIMO) systems, where the motivation comes from the fact that the channel estimation performance can be improved if we exploit additional common sparsity among nearby users. In the literature, a commonly used group sparsity model assumes that users in each group share a uniform sparsity pattern. In practice, however, this oversimplified assumption usually fails to hold, even for physically close users. Outliers deviated from the uniform sparsity pattern in each group may significantly degrade the effectiveness of common sparsity, and hence bring limited (or negative) gain for channel estimation. To better capture the group sparse structure in practice, we provide a general model having two sparsity components: commonly shared sparsity and individual sparsity, where the additional individual sparsity accounts for any outliers. Then, we propose a novel sparse Bayesian learning (SBL)-based framework to address the joint channel estimation and user grouping problem under the general sparsity model. The framework can fully exploit the common sparsity among nearby users and exclude the harmful effect from outliers simultaneously. Simulation results reveal substantial performance gains over the existing state-of-the-art baselines.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
