LiST-BF Design: Achieving the SDP Bound for Downlink Beamforming with Arbitrary Shaping Constraints
LiST-BF Design: Achieving the SDP Bound for Downlink Beamforming with Arbitrary Shaping Constraints
复制标题
DOI：
--
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
Feng Wang;Chongbin Xu;Yongwei Huang;Xin Wang;Xiqi Gao
中科院分区：
文献类型：
--
作者：
Feng Wang;Chongbin Xu;Yongwei Huang;Xin Wang;Xiqi Gao
本文考虑了多用户多输入单输出（MU-MISO）下行链路的波束成形设计与任意数量的（上下文特定的）成形约束。在这种情况下，现有的波束形成方案无法达到半定规划（SDP）松弛技术所承诺的性能界限。为了弥补这一差距，本文提出了一种线性空时波束形成（LiST-BF）方案，该方案由循环空时符号映射器和正交约束波束形成设计组成。结果表明，所提出的LiST-BF方案可以以低复杂度和结构化的方式对用户符号执行一般的秩K波束成形。此外，充分的条件，以保证LiST-BF方案总是达到线性波束形成方案的SDP界。在此基础上，提出了一种在多项式时间内求解最优LiST-BF解的有效算法.数值结果表明，所提出的方案Enjoys显着的性能增益比现有的替代品。
This paper considers the beamforming design for a multiuser multiple-input single-output (MU-MISO) downl ink with an arbitrary number of (context-specific) shaping constraints. In this setup, the state-of-the-art beamformingschemes cannot attain the well-known performance bound promised by the semidefinite program (SDP) relaxation technique. To close the gap, we propose a linear space-time beamforming (LiST-BF) scheme, consisting of a circulant space-time sym bol mapper followed by the beamforming design with orthogonali ty constraints. It is shown that the proposed LiST-BF scheme ca n perform general rank-K beamforming for user symbols in a low-complexity and structured manner. In addition, sufficient conditions are derived to guarantee that the LiST-BF scheme always achieves the SDP bound for linear beamforming scheme s. Based on such conditions, an efficient algorithm is then deve loped to obtain the optimal LiST-BF solution in polynomial time. Numerical results demonstrate that the proposed scheme enj oys substantial performance gains over the existing alternati ves.