基于截止率的低复杂度MIMOME窃听信道预编码

S. R. Aghdam, T. Duman
{"title":"基于截止率的低复杂度MIMOME窃听信道预编码","authors":"S. R. Aghdam, T. Duman","doi":"10.1109/ISIT.2016.7541847","DOIUrl":null,"url":null,"abstract":"We propose a low complexity transmit signal design scheme for achieving information-theoretic secrecy over a MIMO wiretap channel driven by finite-alphabet inputs. We assume that the transmitter has perfect channel state information (CSI) of the main channel and also knows the statistics of the eavesdropper's channel. The proposed transmission scheme relies on jointly optimizing the precoder matrix and the artificial noise so as to maximize the achievable secrecy rates. In order to lower the computational complexity associated with the transmit signal design, we employ a design metric using the cut-off rate instead of the mutual information. We formulate a gradient-descent based optimization algorithm and demonstrate via extensive numerical examples that the proposed signal design scheme can yield an enhanced secrecy performance compared with the existing solutions in spite of its relatively lower computational complexity. The impacts of the modulation order as well as the number of antennas at the transmitter and receiver ends on the achievable secrecy rates are also investigated.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"747 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Low complexity precoding for MIMOME wiretap channels based on cut-off rate\",\"authors\":\"S. R. Aghdam, T. Duman\",\"doi\":\"10.1109/ISIT.2016.7541847\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a low complexity transmit signal design scheme for achieving information-theoretic secrecy over a MIMO wiretap channel driven by finite-alphabet inputs. We assume that the transmitter has perfect channel state information (CSI) of the main channel and also knows the statistics of the eavesdropper's channel. The proposed transmission scheme relies on jointly optimizing the precoder matrix and the artificial noise so as to maximize the achievable secrecy rates. In order to lower the computational complexity associated with the transmit signal design, we employ a design metric using the cut-off rate instead of the mutual information. We formulate a gradient-descent based optimization algorithm and demonstrate via extensive numerical examples that the proposed signal design scheme can yield an enhanced secrecy performance compared with the existing solutions in spite of its relatively lower computational complexity. The impacts of the modulation order as well as the number of antennas at the transmitter and receiver ends on the achievable secrecy rates are also investigated.\",\"PeriodicalId\":198767,\"journal\":{\"name\":\"2016 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"747 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2016.7541847\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2016.7541847","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

我们提出了一种低复杂度的传输信号设计方案,用于在有限字母输入驱动的MIMO窃听信道上实现信息理论保密。我们假设发射机拥有完善的主信道信道状态信息(CSI),并且知道窃听者信道的统计信息。提出的传输方案依赖于联合优化预编码器矩阵和人工噪声,以最大限度地提高可实现的保密率。为了降低与发射信号设计相关的计算复杂度,我们采用了使用截止率而不是互信息的设计度量。我们制定了一种基于梯度下降的优化算法,并通过大量的数值实例证明,尽管所提出的信号设计方案的计算复杂度相对较低,但与现有解决方案相比,该方案可以提高保密性能。研究了调制顺序以及收发端天线个数对可实现保密率的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Low complexity precoding for MIMOME wiretap channels based on cut-off rate
We propose a low complexity transmit signal design scheme for achieving information-theoretic secrecy over a MIMO wiretap channel driven by finite-alphabet inputs. We assume that the transmitter has perfect channel state information (CSI) of the main channel and also knows the statistics of the eavesdropper's channel. The proposed transmission scheme relies on jointly optimizing the precoder matrix and the artificial noise so as to maximize the achievable secrecy rates. In order to lower the computational complexity associated with the transmit signal design, we employ a design metric using the cut-off rate instead of the mutual information. We formulate a gradient-descent based optimization algorithm and demonstrate via extensive numerical examples that the proposed signal design scheme can yield an enhanced secrecy performance compared with the existing solutions in spite of its relatively lower computational complexity. The impacts of the modulation order as well as the number of antennas at the transmitter and receiver ends on the achievable secrecy rates are also investigated.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
String concatenation construction for Chebyshev permutation channel codes Cyclically symmetric entropy inequalities Near-capacity protograph doubly-generalized LDPC codes with block thresholds On the capacity of a class of dual-band interference channels Distributed detection over connected networks via one-bit quantizer
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1