A Worst-Case Performance Optimization Based Design Approach to Robust Symbol-Level Precoding for Downlink MU-MIMO
This paper addresses the optimization problem of symbol-level precoding (SLP) in the downlink of a multiuser multiple-input multiple-output (MU-MIMO) wireless system while the precoder's output is subject to partially-known distortions. In particular, we assume a linear distortion model with bounded additive noise. The original signal-to-interference-plus-noise ratio (SINR) -constrained SLP problem minimizing the total transmit power is first reformulated as a penalized unconstrained problem, which is referred to as the relaxed robust formulation. We then adopt a worst-case design approach to protect the users' intended symbols and the targeted constructive interference with a desired level of confidence. Due to the non-convexity of the relaxed robust formulation, we propose an iterative algorithm based on the block coordinate ascent-descent method. We show through simulation results that the proposed robust design is flexible in the sense that the CI constraints can be relaxed so as to keep a desirable balance between achievable rate and power consumption. Remarkably, the new formulation yields more energy-efficient solutions for appropriate choices of the penalty parameter, compared to the original problem.
Code (0)
등록된 구현이 없습니다.
Tasks
Robust DesignSimilar Papers 제목 키워드 기반
Worst-Case Symbolic Constraints Analysis and Generalisation with Large Language Models
Large language models (LLMs) have been successfully applied to a variety of coding tasks, including code generation, completion, and repair. However, more complex symbolic reasoning tasks remain largely unexplored by LLM…
Code GenerationSymbol Level Precoding for Systems with Improper Gaussian Interference
This paper focuses on precoding design in multi-antenna systems with improper Gaussian interference (IGI), characterized by correlated real and imaginary parts. We first study block level precoding (BLP) and symbol level…
Discovering Expert-Level Nash Equilibrium Algorithms with Large Language Models
Designing polynomial-time algorithms for approximate Nash equilibria (ANE) with provable worst-case guarantees is a fundamental open problem in algorithmic game theory. While large language models (LLMs) can generate can…
Beamforming in Integrated Sensing and Communication Systems with Reconfigurable Intelligent Surfaces
We consider transmit beamforming and reflection pattern design in reconfigurable intelligent surface (RIS)-assisted integrated sensing and communication (ISAC) systems to jointly precode communication symbols and radar w…
Integrated sensing and communicationISACSafe Neurosymbolic Learning with Differentiable Symbolic Execution
We study the problem of learning worst-case-safe parameters for programs that use neural networks as well as symbolic, human-written code. Such neurosymbolic programs arise in many safety-critical domains. However, becau…