Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 44 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 13 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 86 tok/s Pro
Kimi K2 208 tok/s Pro
GPT OSS 120B 447 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Robust Beamforming Techniques for Non-Orthogonal Multiple Access Systems with Bounded Channel Uncertainties (1708.07855v1)

Published 25 Aug 2017 in cs.IT and math.IT

Abstract: In this letter, we propose a robust beamforming design for non-orthogonal multiple access (NOMA) based multiple-input single-output (MISO) downlink systems. In particular, the robust power minimization problem is studied with imperfect channel state information (CSI), where the beamformers are designed by incorporating norm-bounded channel uncertainties to provide the required quality of service at each user. This robust scheme is developed based on the worst-case performance optimization framework. In terms of beamforming vectors, the original robust design is not convex and therefore, the robust beamformers cannot be obtained directly. To circumvent this non-convex issue, the original intractable problem is reformulated into a convex problem, where the non-convex constraint is converted into a linear matrix inequality (LMI) by exploiting S-Procedure. Finally, simulation results are provided to demonstrate the effectiveness of the proposed robust design.

Citations (56)

Summary

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

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