[Paper Review] Joint User Identification, Channel Estimation, and Signal Detection for Grant-Free NOMA

Shuchao Jiang, Xiaojun Yuan+3 more|arXiv (Cornell University)|Jan 12, 2020

Advanced Wireless Communication Technologies39 references4 citations

TL;DR

This paper proposes a joint user identification, channel estimation, and signal detection (JUICESD) algorithm for grant-free non-orthogonal multiple access (NOMA) in massive machine-type communications. By leveraging approximate message passing (AMP) and a novel rotationally invariant Gaussian mixture (RIGM) model, the JUICESD-RIGM algorithm achieves near-optimal performance with significantly reduced complexity, validated through state evolution analysis and numerical results showing superior performance over existing methods.

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.

Motivation & Objective

• To address the high signaling overhead of conventional grant-based multiple access in massive machine-type communications (mMTC).
• To jointly solve user activity detection, channel estimation, and signal detection in grant-free NOMA, which are interdependent and challenging due to phase ambiguity.
• To reduce computational complexity while maintaining high detection accuracy in sparse signal recovery for short-packet mMTC systems.
• To develop a theoretically grounded performance prediction method using state evolution for the proposed algorithm.
• To enable efficient receiver design for mMTC with massive connectivity and low-latency requirements.

Proposed method

• The algorithm decomposes detection into two modules: slot-wise multi-user detection (SMD) using approximate message passing (AMP) to decouple user signals.
• A combined signal and channel estimation (CSCE) module handles the nonlinear coupling between user activity, channel coefficients, and transmitted signals.
• A rotationally invariant Gaussian mixture (RIGM) model is introduced to simplify message passing and mitigate phase ambiguity issues in iterative detection.
• The JUICESD-RIGM algorithm iteratively updates user activity, channel estimates, and data symbols using message passing with RIGM-based priors.
• State evolution techniques are derived to analytically predict the performance of JUICESD-RIGM, enabling accurate system design and optimization.
• The algorithm is designed for low-complexity operation, with complexity scaling favorably with system parameters such as number of users and time slots.

Experimental results

Research questions

• RQ1 Can joint user identification, channel estimation, and signal detection be efficiently performed in grant-free NOMA with low computational complexity?
• RQ2 How can phase ambiguity in message passing be effectively modeled and mitigated in sparse signal recovery for NOMA?
• RQ3 To what extent does the RIGM model improve the accuracy and efficiency of message passing in joint detection?
• RQ4 Can state evolution accurately predict the performance of the proposed JUICESD-RIGM algorithm in practical mMTC scenarios?
• RQ5 How does JUICESD-RIGM compare in performance and complexity to existing state-of-the-art receivers, including LMMSE with oracle knowledge?

Key findings

• JUICESD-RIGM achieves performance close to the optimal JUICESD algorithm while reducing complexity significantly, making it suitable for massive IoT deployments.
• The proposed state evolution analysis accurately predicts system performance, with predictions closely matching simulation results.
• Numerical results show that JUICESD-RIGM outperforms existing algorithms, including LMMSE with oracle user activity information.
• The algorithm achieves a significant performance gain over conventional methods, particularly in low-SNR and high-multiplexing scenarios.
• The complexity of JUICESD-RIGM is bounded by O(KT²|S|) for the main computation, with additional terms for message passing and estimation, making it scalable for large-scale systems.
• The RIGM model effectively captures rotational invariance in phase-ambiguous signals, enabling robust and accurate joint estimation.