Papers
Topics
Authors
Recent
Search
2000 character limit reached

Low-Complexity Equalization and Detection for OTFS-NOMA

Published 14 Nov 2022 in eess.SP | (2211.07388v1)

Abstract: Orthogonal time frequency space (OTFS) modulation has recently emerged as a potential 6G candidate waveform which provides improved performance in high-mobility scenarios. In this paper we investigate the combination of OTFS with non-orthogonal multiple access (NOMA). Existing equalization and detection methods for OTFS-NOMA, such as minimum-mean-squared error with successive interference cancellation (MMSE-SIC), suffer from poor performance. Additionally, existing iterative methods for single-user OTFS based on low-complexity iterative least-squares solvers are not directly applicable to the NOMA scenario due to the presence of multi-user interference (MUI). Motivated by this, in this paper we propose a low-complexity method for equalization and detection for OTFS-NOMA. Our proposed method uses an iterative process where in each iteration, an equalizer based on the least-squares with QR factorization (LSQR) algorithm is followed by a novel reliability zone (RZ) detection scheme which estimates the reliable symbols of the users and then uses interference cancellation to remove MUI. We present numerical results which demonstrate the superiority of our proposed method, in terms of symbol error rate (SER), to the existing MMSE-SIC benchmark scheme. Additionally, we present results which illustrate that a judicious choice of RZ thresholds is important for optimizing the performance of the proposed algorithm.

Citations (5)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.