基于概率分布学习算法的MIMO系统联合收发天线选择

M. Naeem, Daniel C. Lee
{"title":"基于概率分布学习算法的MIMO系统联合收发天线选择","authors":"M. Naeem, Daniel C. Lee","doi":"10.1109/RWS.2010.5434265","DOIUrl":null,"url":null,"abstract":"In this paper, we present a real-time low-complexity joint transmit and receive antenna selection (JTRAS) algorithm. The computational complexity of finding an optimal JTRAS by exhaustive search grows exponentially with the number of transmit and receive antennas. The proposed Estimation of Distribution Algorithm (EDA) is resorts to probabilistic distribution learning evolutionary computation. EDA updates its chosen population at each iteration on the basis of the probability distribution learned from the population of superior candidate solutions chosen at the previous iterations. The proposed EDA has a low computational complexity and can find a nearly optimal solution in real time. Beyond applying the general EDA to JTRAS, we also present a specific improvement to EDA, which reduces computation time by generating cyclic shifted initial population. The proposed EDA for JTRAS has a low computational complexity, and its effectiveness is verified through simulation results.","PeriodicalId":334671,"journal":{"name":"2010 IEEE Radio and Wireless Symposium (RWS)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Joint transmit and receive antenna selection using a probabilistic distribution learning algorithm in MIMO systems\",\"authors\":\"M. Naeem, Daniel C. Lee\",\"doi\":\"10.1109/RWS.2010.5434265\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a real-time low-complexity joint transmit and receive antenna selection (JTRAS) algorithm. The computational complexity of finding an optimal JTRAS by exhaustive search grows exponentially with the number of transmit and receive antennas. The proposed Estimation of Distribution Algorithm (EDA) is resorts to probabilistic distribution learning evolutionary computation. EDA updates its chosen population at each iteration on the basis of the probability distribution learned from the population of superior candidate solutions chosen at the previous iterations. The proposed EDA has a low computational complexity and can find a nearly optimal solution in real time. Beyond applying the general EDA to JTRAS, we also present a specific improvement to EDA, which reduces computation time by generating cyclic shifted initial population. The proposed EDA for JTRAS has a low computational complexity, and its effectiveness is verified through simulation results.\",\"PeriodicalId\":334671,\"journal\":{\"name\":\"2010 IEEE Radio and Wireless Symposium (RWS)\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-01-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Radio and Wireless Symposium (RWS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RWS.2010.5434265\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Radio and Wireless Symposium (RWS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RWS.2010.5434265","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种实时低复杂度联合收发天线选择(JTRAS)算法。通过穷举搜索寻找最优JTRAS的计算复杂度随着发射和接收天线的数量呈指数增长。本文提出的分布估计算法(EDA)是基于概率分布学习的进化计算。EDA根据从前一次迭代中选择的优秀候选解决方案的总体中学习到的概率分布,在每次迭代中更新其选择的总体。所提出的EDA计算复杂度低,能实时找到接近最优解。除了将通用EDA应用于JTRAS之外,我们还提出了对EDA的具体改进,该改进通过生成循环移位的初始种群来减少计算时间。提出的JTRAS EDA计算复杂度低,仿真结果验证了其有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Joint transmit and receive antenna selection using a probabilistic distribution learning algorithm in MIMO systems
In this paper, we present a real-time low-complexity joint transmit and receive antenna selection (JTRAS) algorithm. The computational complexity of finding an optimal JTRAS by exhaustive search grows exponentially with the number of transmit and receive antennas. The proposed Estimation of Distribution Algorithm (EDA) is resorts to probabilistic distribution learning evolutionary computation. EDA updates its chosen population at each iteration on the basis of the probability distribution learned from the population of superior candidate solutions chosen at the previous iterations. The proposed EDA has a low computational complexity and can find a nearly optimal solution in real time. Beyond applying the general EDA to JTRAS, we also present a specific improvement to EDA, which reduces computation time by generating cyclic shifted initial population. The proposed EDA for JTRAS has a low computational complexity, and its effectiveness is verified through simulation results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信