...
首页> 外文期刊>Communications Letters, IEEE >AN-Aided Secrecy Precoding for SWIPT in Cognitive MIMO Broadcast Channels
【24h】

AN-Aided Secrecy Precoding for SWIPT in Cognitive MIMO Broadcast Channels

机译:认知MIMO广播信道中针对SWIPT的AN辅助保密预编码

获取原文
获取原文并翻译 | 示例
           

摘要

In this letter, we study the secrecy precoding problem for simultaneous wireless information and power transfer (SWIPT) in a cognitive multiple-input multiple-output (MIMO) broadcast channel. We adopt an artificial noise (AN)-aided precoding scheme and formulate the problem as a secrecy rate maximization (SRM) problem, which is subject to both an interference power constraint imposed to protect the primary user (PU) and an energy harvesting constraint required by the secondary energy receiver (SER). Since the formulated SRM problem constitutes a difference convex (DC)-type programming problem, we solve it by employing a successive convex approximation (SCA) method. With the SCA method, the nonconvex part of the SRM problem can be locally linearized to its first-order Taylor expansion. Then, relying on solving a series of convexified optimization problems, an iterative precoding algorithm is developed. Numerical simulations are also provided to demonstrate the proposed algorithm. Results show that our algorithm can achieve a near-optimal performance with guaranteed convergence.
机译:在这封信中,我们研究了认知多输入多输出(MIMO)广播信道中同时进行的无线信息和功率传输(SWIPT)的保密预编码问题。我们采用人工噪声(AN)辅助的预编码方案,并将该问题表示为保密率最大化(SRM)问题,该问题既要受到保护主要用户(PU)的干扰功率约束又要受到能量收集约束的约束通过次级能量接收器(SER)。由于公式化的SRM问题构成了差分凸(DC)型编程问题,因此我们通过采用逐次凸逼近(SCA)方法解决该问题。使用SCA方法,可以将SRM问题的非凸部分局部线性化为其一阶泰勒展开。然后,依靠解决一系列凸优化问题,开发了一种迭代预编码算法。还提供了数值仿真来证明所提出的算法。结果表明,我们的算法可以在保证收敛的情况下达到接近最佳的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号