Linear Precoding for Fading Cognitive Multiple Access Wiretap Channel with Finite-Alphabet Inputs
Preprint
Abstract
We investigate the fading cognitive multiple access wiretap channel (CMAC-WT), in which two secondary-user transmitters (STs) send secure messages to a secondary-user receiver (SR) in the presence of an eavesdropper (ED) and subject to interference threshold constraints at multiple primary-user receivers (PRs). We design linear precoders to maximize the average secrecy sum rate for multiple-input multiple-output (MIMO) fading CMAC-WT under finite-alphabet inputs and statistical channel state information (CSI) at STs. For this non-deterministic polynomial time (NP)-hard problem, we utilize an accurate approximation of the average secrecy sum rate to reduce the computational complexity, and then present a two-layer algorithm by embedding the convex-concave procedure into an outer approximation framework. The idea behind this algorithm is to reformulate the approximated average secrecy sum rate as a difference of convex functions, and then generate a sequence of simpler relaxed sets to approach the non-convex feasible set. Subsequently, we maximize the approximated average secrecy sum rate over the sequence of relaxed sets by using the convex-concave procedure. Numerical results indicate that our proposed precoding algorithm is superior to the conventional Gaussian precoding method in the medium and high signal-to-noise ratio (SNR) regimes.Keywords
All Related Versions
This publication has 33 references indexed in Scilit:
- Feasible Point Pursuit and Successive Approximation of Non-Convex QCQPsIEEE Signal Processing Letters, 2014
- Large System Analysis of Linear Precoding in MISO Broadcast Channels with Confidential MessagesIEEE Journal on Selected Areas in Communications, 2013
- Decode-and-Forward Relay Beamforming for Secrecy with Finite-Alphabet InputIEEE Communications Letters, 2013
- Globally Optimal Precoder Design with Finite-Alphabet Inputs for Cognitive Radio NetworksIEEE Journal on Selected Areas in Communications, 2012
- A sequential parametric convex approximation method with applications to nonconvex truss topology design problemsJournal of Global Optimization, 2009
- Improving the efficiency of DC global optimization methods by improving the DC representation of the objective functionJournal of Global Optimization, 2008
- Joint Beamforming and Power Allocation for Multiple Access Channels in Cognitive Radio NetworksIEEE Journal on Selected Areas in Communications, 2008
- A Matrix Handbook for Statisticians2007
- On maximization of quadratic form over intersection of ellipsoids with common centerMathematical Programming, 1999
- Communication Theory of Secrecy Systems*Bell System Technical Journal, 1949