数字相控阵全双工通信的信息论优化

Ian T. Cummings, T. Schulz, J. Doane, S. Zekavat, T. Havens
{"title":"数字相控阵全双工通信的信息论优化","authors":"Ian T. Cummings, T. Schulz, J. Doane, S. Zekavat, T. Havens","doi":"10.1109/ALLERTON.2018.8635860","DOIUrl":null,"url":null,"abstract":"This paper poses full-duplex phase shift keyed communication between two digital phased arrays as an estimation problem and outlines an approach to minimizing the symbol phase estimation error. We develop an information-theoretic bound on the estimation error and a related feasible optimization objective function for the communications link in terms of the transmit and receive beamformers. We also apply a genetic algorithm to search for a transmit/receive aperture partitioning that minimizes the estimation error bound.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Information-Theoretic Optimization of Full-Duplex Communication between Digital Phased Arrays\",\"authors\":\"Ian T. Cummings, T. Schulz, J. Doane, S. Zekavat, T. Havens\",\"doi\":\"10.1109/ALLERTON.2018.8635860\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper poses full-duplex phase shift keyed communication between two digital phased arrays as an estimation problem and outlines an approach to minimizing the symbol phase estimation error. We develop an information-theoretic bound on the estimation error and a related feasible optimization objective function for the communications link in terms of the transmit and receive beamformers. We also apply a genetic algorithm to search for a transmit/receive aperture partitioning that minimizes the estimation error bound.\",\"PeriodicalId\":299280,\"journal\":{\"name\":\"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ALLERTON.2018.8635860\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2018.8635860","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文将两个数字相控阵之间的全双工相移键控通信作为一个估计问题,提出了一种最小化符号相位估计误差的方法。从发射和接收波束形成的角度出发,给出了估计误差的信息论界和相应的可行优化目标函数。我们还应用遗传算法来搜索最小估计误差界的发射/接收孔径划分。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Information-Theoretic Optimization of Full-Duplex Communication between Digital Phased Arrays
This paper poses full-duplex phase shift keyed communication between two digital phased arrays as an estimation problem and outlines an approach to minimizing the symbol phase estimation error. We develop an information-theoretic bound on the estimation error and a related feasible optimization objective function for the communications link in terms of the transmit and receive beamformers. We also apply a genetic algorithm to search for a transmit/receive aperture partitioning that minimizes the estimation error bound.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信