Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Robust Beamforming Design for OTFS-NOMA (1910.14422v1)

Published 31 Oct 2019 in cs.IT and math.IT

Abstract: This paper considers the design of beamforming for orthogonal time frequency space modulation assisted non-orthogonal multiple access (OTFS-NOMA) networks, in which a high-mobility user is sharing the spectrum with multiple low-mobility NOMA users. In particular, the beamforming design is formulated as an optimization problem whose objective is to maximize the low-mobility NOMA users' data rates while guaranteeing that the high-mobility user's targeted data rate can be met. Both the cases with and without channel state information errors are considered, where low-complexity solutions are developed by applying successive convex approximation and semidefinite relaxation. Simulation results are also provided to show that the use of the proposed beamforming schemes can yield a significant performance gain over random beamforming.

Citations (29)

Summary

We haven't generated a summary for this paper yet.