arXivDaily arXiv每日学术速递 周一至周五更新
今晚才能更新了~~大家休息下再来吧
arXiv 2004.03113eess.SP
收藏

Generalized Quadratic Matrix Programming: A Unified Framework for Linear Precoding With Arbitrary Input Distributions

Juening Jin, Yahong Rosa~Zheng, Wen Chen, Chengshan Xiao

英文摘要:

This paper investigates a new class of non-convex optimization, which provides a unified framework for linear precoding in single/multi-user multiple-input multiple-output (MIMO) channels with arbitrary input distributions. The new optimization is called generalized quadratic matrix programming (GQMP). Due to the nondeterministic polynomial time (NP)-hardness of GQMP problems, instead of seeking globally optimal solutions, we propose an efficient algorithm which is guaranteed to converge to a Karush-Kuhn-Tucker (KKT) point. The idea behind this algorithm is to construct explicit concave lower bounds for non-convex objective and constraint functions, and then solve a sequence of concave maximization problems until convergence. In terms of application, we consider a downlink underlay secure cognitive radio (CR) network, where each node has multiple antennas. We design linear precoders to maximize the average secrecy (sum) rate with finite-alphabet inputs and statistical channel state information (CSI) at the transmitter. The precoding problems under secure multicast/broadcast scenarios are GQMP problems, and thus they can be solved efficiently by our proposed algorithm. Several numerical examples are provided to show the efficacy of our algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑