اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAn Approximate Solution for Symbol-Level Multiuser Precoding Using Support Recovery
76
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we propose a low-complexity method to approximately solve the SINR-constrained optimization problem of symbol-level precoding (SLP). First, assuming a generic modulation scheme, the precoding optimization problem is recast as a standard non-negative least squares (NNLS). Then, we improve an existing closed-form SLP (CF-SLP) scheme using the conditions for nearly perfect recovery of the optimal solution support, followed by solving a reduced system of linear equations. We show through simulation results that in comparison with the CF-SLP method, the improved approximate solution of this paper, referred to as ICF-SLP, significantly enhances the performance with a negligible increase in complexity. We also provide comparisons with a fast-converging iterative NNLS algorithm, where it is shown that the ICF-SLP method is comparable in performance to the iterative algorithm with a limited maximum number of iterations. Analytic discussions on the complexities of different methods are provided, verifying the computational efficiency of the proposed method. Our results further indicate that the ICF-SLP scheme performs quite close to the optimal SLP, particularly in the large system regime.
قيم البحث
اقرأ أيضاً
In this paper, we address robust design of symbol-level precoding for the downlink of multiuser multiple-input multiple-output wireless channels, in the presence of imperfect channel state information (CSI) at the transmitter. In particular, we consi
der two common uncertainty models for the CSI imperfection, namely, spherical (bounded) and stochastic (Gaussian). Our design objective is to minimize the total (per-symbol) transmission power subject to constructive interference (CI) constraints as well as users quality-of-service requirements in terms of signal-to-interference-plus-noise ratio. Assuming bounded channel uncertainties, we obtain a convex CI constraint based on the worst-case robust analysis, whereas in the case of Gaussian uncertainties, we define probabilistic CI constraints in order to achieve robustness to statistically-known CSI errors. Since the probabilistic constraints of actual interest are difficult to handle, we resort to their convex approximations, yielding tractable (deterministic) robust constraints. Three convex approximations are developed based on different robust conservatism approaches, among which one is introduced as a benchmark for comparison. We show that each of our proposed approximations is tighter than the other under specific robustness conditions, while both always outperform the benchmark. Using the developed CI constraints, we formulate the robust precoding optimization as a convex conic quadratic program. Extensive simulation results are provided to validate our analytic discussions and to make comparisons with existing robust precoding schemes. We also show that the robust design increases the computational complexity by an order of the number of users in the large system limit, compared to its non-robust counterpart.
In this letter, we study the optimal solution of the multiuser symbol-level precoding (SLP) for minimization of the total transmit power under given signal-to-interference-plus-noise ratio (SINR) constraints. Adopting the distance preserving construc
tive interference regions (DPCIR), we first derive a simplified reformulation of the problem. Then, we analyze the structure of the optimal solution using the Karush-Kuhn-Tucker (KKT) optimality conditions, thereby we obtain the necessary and sufficient condition under which the power minimizer SLP is equivalent to the conventional zero-forcing beamforming (ZFBF). This further leads us to a closed-form sub-optimal SLP solution (CF-SLP) for the original problem. Simulation results show that CF-SLP provides significant gains over ZFBF, while performing quite close to the optimal SLP in scenarios with rather small number of users. The results further indicate that the CF-SLP method has a reduction of order $10^3$ in computational time compared to the optimal solution.
In this paper, we address the symbol level precoding (SLP) design problem under max-min SINR criterion in the downlink of multiuser multiple-input single-output (MISO) channels. First, we show that the distance preserving constructive interference re
gions (DPCIR) are always polyhedral angles (shifted pointed cones) for any given constellation point with unbounded decision region. Then we prove that any signal in a given unbounded DPCIR has a norm larger than the norm of the corresponding vertex if and only if the convex hull of the constellation contains the origin. Using these properties, we show that the power of the noiseless received signal lying on an unbounded DPCIR is an strictly increasing function of two parameters. This allows us to reformulate the originally non-convex SLP max-min SINR as a convex optimization problem. We discuss the loss due to our proposed convex reformulation and provide some simulation results.
In this paper, we investigate the symbol-level precoding (SLP) design problem in the downlink of a multiuser multiple-input single-output (MISO) channel. We consider generic constellations with any arbitrary shape and size, and confine ourselves to o
ne of the main categories of constructive interference regions (CIR), namely, distance preserving CIR (DPCIR). We provide a comprehensive study of DPCIRs and derive some properties for these regions. Using these properties, we first show that any signal in a given DPCIR has a norm greater than or equal to the norm of the corresponding constellation point if and only if the convex hull of the constellation contains the origin. It is followed by proving that the power of the noiseless received signal lying on a DPCIR is a monotonic strictly increasing function of two parameters relating to the infinite Voronoi edges. Using the convex description of DPCIRs and their properties, we formulate two design problems, namely, the SLP power minimization with signal-to-interference-plus-noise ratio (SINR) constraints, and the SLP SINR balancing problem under max-min fairness criterion. The SLP power minimization based on DPCIRs can straightforwardly be written as a quadratic program (QP). We provide a simplified reformulation of this problem which is less computationally complex. The SLP max-min SINR, however, is non-convex in its original form, and hence difficult to tackle. We propose several alternative optimization approaches, including semidefinite program (SDP) formulation and block coordinate descent (BCD) optimization. We discuss and evaluate the loss due to the proposed alternative methods through extensive simulation results.
Dual-functional radar-communication (DFRC) systems can simultaneously perform both radar and communication functionalities using the same hardware platform and spectrum resource. In this paper, we consider multi-input multi-output (MIMO) DFRC systems
and focus on transmit beamforming designs to provide both radar sensing and multi-user communications. Unlike conventional block-level precoding techniques, we propose to use the recently emerged symbol-level precoding approach in DFRC systems, which provides additional degrees of freedom (DoFs) that guarantee preferable instantaneous transmit beampatterns for radar sensing and achieve better communication performance. In particular, the squared error between the designed and desired beampatterns is minimized subject to the quality-of-service (QoS) requirements of the communication users and the constant-modulus power constraint. Two efficient algorithms are developed to solve this non-convex problem on both the Euclidean and Riemannian spaces. The first algorithm employs penalty dual decomposition (PDD), majorization-minimization (MM), and block coordinate descent (BCD) methods to convert the original optimization problem into two solvable sub-problems, and iteratively solves them using efficient algorithms. The second algorithm provides a much faster solution at the price of a slight performance loss, first transforming the original problem into Riemannian space, and then utilizing the augmented Lagrangian method (ALM) to obtain an unconstrained problem that is subsequently solved via a Riemannian Broyden-Fletcher-Goldfarb-Shanno (RBFGS) algorithm. Extensive simulations verify the distinct advantages of the proposed symbol-level precoding designs in both radar sensing and multi-user communications.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
