论文标题
块级干扰剥削的预编码,而无需符号优化
Block-Level Interference Exploitation Precoding without Symbol-by-Symbol Optimization
论文作者
论文摘要
基于建设性干扰(CI)的概念,符号级的预编码(SLP)被证明优于传统的块级预码(BLP),但是在预言设计过程中以符号符号优化为代价。在本文中,我们提出了一个基于CI的块级预码(CI-BLP)方案,用于多用户多用户多输入单输出(MU-MISO)通信系统的下行链路传输,在此我们将恒定的预编码矩阵设计到一个符号插槽块以同时为每个符号插槽中利用CI的稳定矩阵。提出了一个单一的优化问题,以最大化整个块上的最小CI效应,从而降低了传统SLP的计算成本,因为仅需要一个每个块就可以解决一次优化问题。通过利用Karush-Kuhn-Tucker(KKT)条件和双重问题公式,最终证明了原始优化问题与单纯形相当于二次编程(QP)。由于宽松的块级功率约束,数值结果验证了我们的推导和表现出优于传统BLP和SLP方法的卓越性能。
Symbol-level precoding (SLP) based on the concept of constructive interference (CI) is shown to be superior to traditional block-level precoding (BLP), however at the cost of a symbol-by-symbol optimization during the precoding design. In this paper, we propose a CI-based block-level precoding (CI-BLP) scheme for the downlink transmission of a multi-user multiple-input single-output (MU-MISO) communication system, where we design a constant precoding matrix to a block of symbol slots to exploit CI for each symbol slot simultaneously. A single optimization problem is formulated to maximize the minimum CI effect over the entire block, thus reducing the computational cost of traditional SLP as the optimization problem only needs to be solved once per block. By leveraging the Karush-Kuhn-Tucker (KKT) conditions and the dual problem formulation, the original optimization problem is finally shown to be equivalent to a quadratic programming (QP) over a simplex. Numerical results validate our derivations and exhibit superior performance for the proposed CI-BLP scheme over traditional BLP and SLP methods, thanks to the relaxed block-level power constraint.