Achievable ergodic secrecy rate for MIMO SWIPT wiretap channels

Jun Zhang, C. Yuen, Chao-Kai Wen, Shi Jin, Kai‐Kit Wong, Hongbo Zhu
{"title":"Achievable ergodic secrecy rate for MIMO SWIPT wiretap channels","authors":"Jun Zhang, C. Yuen, Chao-Kai Wen, Shi Jin, Kai‐Kit Wong, Hongbo Zhu","doi":"10.1109/ICCW.2015.7247221","DOIUrl":null,"url":null,"abstract":"In this paper, we study the multiple-input multiple-output (MIMO) wiretap channel performing simultaneous wireless information and power transfer (SWIPT), where there are a multiple-antenna base station (BS), a multiple-antenna information decoding (ID) user, and a multiple-antenna energy harvesting (EH) user. The messages intended to the ID user need to be kept confidential to the EH user. The channels between BS and users are modeled as fading channels with different spatial correlations and line-of-sight (LoS) components. We assume that only statistical channel state information (CSI) is available at the BS. Our objective is to design the optimal transmit covariance matrix at the BS for maximizing the ergodic secrecy rate subject to the BS power constraint and the harvested energy requirement for the EH user. To this end, we present an approximation for the ergodic secrecy rate by using large dimensional random matrix theory and the method of Taylor series expansion. Based on this, an iterative algorithm is proposed to find the transmit covariance matrix. Simulation results are provided to verify the accuracy of the approximation and the performance of the design.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"49 1","pages":"453-458"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Communication Workshop (ICCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2015.7247221","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In this paper, we study the multiple-input multiple-output (MIMO) wiretap channel performing simultaneous wireless information and power transfer (SWIPT), where there are a multiple-antenna base station (BS), a multiple-antenna information decoding (ID) user, and a multiple-antenna energy harvesting (EH) user. The messages intended to the ID user need to be kept confidential to the EH user. The channels between BS and users are modeled as fading channels with different spatial correlations and line-of-sight (LoS) components. We assume that only statistical channel state information (CSI) is available at the BS. Our objective is to design the optimal transmit covariance matrix at the BS for maximizing the ergodic secrecy rate subject to the BS power constraint and the harvested energy requirement for the EH user. To this end, we present an approximation for the ergodic secrecy rate by using large dimensional random matrix theory and the method of Taylor series expansion. Based on this, an iterative algorithm is proposed to find the transmit covariance matrix. Simulation results are provided to verify the accuracy of the approximation and the performance of the design.
MIMO SWIPT窃听信道可实现的遍历保密率
本文研究了多输入多输出(MIMO)窃听信道同时进行无线信息和电力传输(SWIPT),其中存在一个多天线基站(BS)、一个多天线信息解码(ID)用户和一个多天线能量收集(EH)用户。发送给ID用户的消息需要对EH用户保密。将BS和用户之间的信道建模为具有不同空间相关性和视距分量的衰落信道。我们假设在BS中只有统计通道状态信息(CSI)可用。我们的目标是设计最优的传输协方差矩阵,以最大限度地提高EH用户在BS功率约束和收获能量需求下的遍历保密率。为此,我们利用大维随机矩阵理论和泰勒级数展开方法给出了遍历保密率的近似。在此基础上,提出了一种求发射协方差矩阵的迭代算法。仿真结果验证了近似的准确性和设计的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信