Linear Precoding For Cognitive Multiple Access Wiretap Channel With Finite-Alphabet Inputs

2016 IEEE International Conference on Communications (ICC)(2016)

引用 0|浏览16
暂无评分
摘要
This paper investigates the linear precoder design for cognitive multiple-access wiretap channel (CMAC-WT), where two secondary-user transmitters (STs) communicate with one secondary-user receiver (SR) in the presence of an eavesdropper and subject to interference threshold constraints at primaryuser receivers (PRs). It designs linear precoders to maximize the ergodic secrecy sum rate for multiple-input multiple-output (MIMO) CMAC-WT under finite-alphabet inputs and statistical channel state information (CSI). For this non-convex problem, a two-layer algorithm is proposed by embedding the convex-concave procedure into an outer approximation framework. The key idea of this algorithm is to reformulate the approximated ergodic secrecy sum rate as a difference of convex (DC) functions, and then generate a sequence of simpler relaxed sets to approach the non-convex feasible set. In this way, near optimal precoding matrices are obtained by maximizing the approximated ergodic secrecy sum rate over a sequence of relaxed sets. Numerical results show that the proposed precoder design provides a significant performance gain over the Gaussian precoding method in the medium and high SNR regimes.
更多
查看译文
关键词
SNR regime,Gaussian precoding method,near-optimal precoding matrices,difference-of-convex functions,outer approximation framework,convex-concave procedure,two-layer algorithm,nonconvex problem,statistical CSI,statistical channel state information,MIMO CMAC-WT,multiple-input multiple-output CMAC-WT,ergodic secrecy sum rate,primary-user receivers,interference threshold constraints,secondary-user receiver,secondary-user transmitters,linear precoder design,finite-alphabet inputs,cognitive multiple-access wiretap channel
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要