Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userJoint User Identification, Channel Estimation, and Signal Detection for Grant-Free NOMA
136
0
0.0
(
0
)
Added by
Chongbin Xu
Publication date
2020
fields
Electronic Engineering
and research's language is
English
Authors
Shuchao Jiang
Ask ChatGPT about the research
No Arabic abstract
For massive machine-type communications, centralized control may incur a prohibitively high overhead. Grant-free non-orthogonal multiple access (NOMA) provides possible solutions, yet poses new challenges for efficient receiver design. In this paper, we develop a joint user identification, channel estimation, and signal detection (JUICESD) algorithm. We divide the whole detection scheme into two modules: slot-wise multi-user detection (SMD) and combined signal and channel estimation (CSCE). SMD is designed to decouple the transmissions of different users by leveraging the approximate message passing (AMP) algorithms, and CSCE is designed to deal with the nonlinear coupling of activity state, channel coefficient and transmit signal of each user separately. To address the problem that the exact calculation of the messages exchanged within CSCE and between the two modules is complicated due to phase ambiguity issues, this paper proposes a rotationally invariant Gaussian mixture (RIGM) model, and develops an efficient JUICESD-RIGM algorithm. JUICESD-RIGM achieves a performance close to JUICESD with a much lower complexity. Capitalizing on the feature of RIGM, we further analyze the performance of JUICESD-RIGM with state evolution techniques. Numerical results demonstrate that the proposed algorithms achieve a significant performance improvement over the existing alternatives, and the derived state evolution method predicts the system performance accurately.
rate research
Read More
In the massive machine-type communication (mMTC) scenario, a large number of devices with sporadic traffic need to access the network on limited radio resources. While grant-free random access has emerged as a promising mechanism for massive access, its potential has not been fully unleashed. In particular, the common sparsity pattern in the received pilot and data signal has been ignored in most existing studies, and auxiliary information of channel decoding has not been utilized for user activity detection. This paper endeavors to develop advanced receivers in a holistic manner for joint activity detection, channel estimation, and data decoding. In particular, a turbo receiver based on the bilinear generalized approximate message passing (BiG-AMP) algorithm is developed. In this receiver, all the received symbols will be utilized to jointly estimate the channel state, user activity, and soft data symbols, which effectively exploits the common sparsity pattern. Meanwhile, the extrinsic information from the channel decoder will assist the joint channel estimation and data detection. To reduce the complexity, a low-cost side information-aided receiver is also proposed, where the channel decoder provides side information to update the estimates on whether a user is active or not. Simulation results show that the turbo receiver is able to reduce the activity detection, channel estimation, and data decoding errors effectively, while the side information-aided receiver notably outperforms the conventional method with a relatively low complexity.
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.
Universal filtered multi-carrier (UFMC), which groups and filters subcarriers before transmission, is a potential multi-carrier modulation technique investigated for the emerging Machine-Type Communications (MTC). Considering the relaxed timing synchronization requirement of UFMC, we design a novel joint timing synchronization and channel estimation method for multi-user UFMC uplink transmission. Aiming at reducing overhead for higher system performance, the joint estimation problem is formulated using atomic norm minimization that enhances the sparsity of timing offset in the continuous frequency domain. Simulation results show that the proposed method can achieve considerable performance gain, as compared with its counterparts.
This paper considers crowded massive multiple input multiple output (MIMO) communications over a Rician fading channel, where the number of users is much greater than the number of available pilot sequences. A joint user identification and line-of-sight (LOS) component derivation algorithm is proposed without requiring a threshold. Based on the derived LOS component, we design a LOS-only channel estimator and an updated channel estimator.
With recent advances on the dense low-earth orbit (LEO) constellation, LEO satellite network has become one promising solution to providing global coverage for Internet-of-Things (IoT) services. Confronted with the sporadic transmission from randomly activated IoT devices, we consider the random access (RA) mechanism, and propose a grant-free RA (GF-RA) scheme to reduce the access delay to the mobile LEO satellites. A Bernoulli-Rician message passing with expectation maximization (BR-MP-EM) algorithm is proposed for this terrestrial-satellite GF-RA system to address the user activity detection (UAD) and channel estimation (CE) problem. This BR-MP-EM algorithm is divided into two stages. In the inner iterations, the Bernoulli messages and Rician messages are updated for the joint UAD and CE problem. Based on the output of the inner iterations, the expectation maximization (EM) method is employed in the outer iterations to update the hyper-parameters related to the channel impairments. Finally, simulation results show the UAD and CE accuracy of the proposed BR-MP-EM algorithm, as well as the robustness against the channel impairments.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
