Title

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

Abstract

This paper investigates a new class of nonconvex optimization, which provides a unified framework for linear precoding in single/multiuser multiple-input multiple-output channels with arbitrary input distributions. The new optimization is called generalized quadratic matrix programming (GQMP). Due to the nondeterministic polynomial time hardness of GQMP problems, instead of seeking globally optimal solutions, we propose an efficient algorithm that is guaranteed to converge to a Karush-Kuhn-Tucker point. The idea behind this algorithm is to construct explicit concave lower bounds for nonconvex 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 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 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.

Department(s)

Electrical and Computer Engineering

Sponsor(s)

National Science Foundation (U.S.)
973 project

Comments

The work of Y. R. Zheng and C. Xiao was supported in part by U.S. National Science Foundation under Grants ECCS-1231848, ECCS-1408316, and ECCS-1539316. The work of W. Chen was supported in part by the National 973 project under Grant 2012CB316106 and by the National 863 project under Grant 2015AA01A710.

Keywords and Phrases

Channel state information; Cognitive radio; Communication channels (information theory); Convex optimization; MIMO systems; Optimization; Polynomial approximation; Polynomials; Secure communication; Arbitrary inputs; Generalized quadratic matrices; Linear pre-coding; Nonconvex optimization; Secrecy sum rates; Matrix algebra; Arbitrary input distributions; Generalized quadratic matrix programming; Linear precoding; MIMO; Non-convex optimization; Secrecy sum rate maximization

International Standard Serial Number (ISSN)

1053-587X

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2017 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.

Share

 
COinS