Robust Symbol Detection in Large-Scale Overloaded NOMA Systems

Abstract

We a framework for the design of low-complexity and high-performance receivers for multidimensional overloaded non-orthogonal multiple access (NOMA) systems. The framework is built upon a novel compressed sensing (CS) regularized maximum likelihood (ML) formulation of the discrete-input detection problem, in which the $\ell _{0}$ -norm is introduced to enforce adherence of the solution to the prescribed discrete symbol constellation. Unlike much of preceding literature,.g., (Assaf et al., 2020, Yeom et al., 2019, Nagahara, 2015, Naderpour and Bizaki, 2020, Hayakawa and Hayashi, 2017, Hayakawa and Hayashi, 2018, and Zeng et al., 2020), the method is not relaxed into the $\ell _{1}$ -norm, but rather approximated with a continuous and asymptotically exact expression without resorting to parallel interference cancellation (PIC). The objective function of the resulting formulation is thus a sum of concave-over-convex ratios, which is then tightly convexified via the quadratic transform (QT), such that its solution can be obtained via the iteration of a simple closed-form expression that closely resembles that of the classic zero-forcing (ZF) receiver, making the method particularly suitable to large-scale set-ups. By further transforming the aforementioned problem into a quadratically constrained quadratic program with one convex constraint (QCQP-1), the optimal regularization parameter to be used at each step of the iterative algorithm is then shown to be the largest generalized eigenvalue of a pair of matrices which are given in closed-form. The method so obtained, referred to as the Iterative Discrete Least Square (IDLS), is then extended to address several factors of practical relevance, such as noisy conditions, imperfect channel state information (CSI), and hardware impairments, thus yielding the Robust IDLS algorithm. Simulation results show that the proposed art significantly outperforms both classic receivers, such as the linear minimum mean square error (LMMSE), and recent CS-based state-of-the-art (SotA) alternatives, such as the sum-of-absolute-values (SOAV) and the sum of complex sparse regularizers (SCSR) detectors. It is also shown via simulations that the technique can be integrated with existing iterative detection-and-decoding (IDD) methods, resulting in accelerated convergence.

Keywords

• Non-orthgonal multi-access (NOMA)
• detection
• overloaded systems
• fractional programming
• iterative least square