Genetic max-SINR algorithm for interference alignment

Navneet Garg, G. Sharma
{"title":"Genetic max-SINR algorithm for interference alignment","authors":"Navneet Garg, G. Sharma","doi":"10.1109/ANTS.2015.7413649","DOIUrl":null,"url":null,"abstract":"In this paper, we propose interference alignment (IA) algorithms inspired by Genetic Algorithm (GA). By simulations for (2 × 2, 1)3 system, we observe that the existing max-SINR (MS) algorithm converges to different sumrates for different initializations of precoders. And the initializations for which sumrate is good, cannot be found trivially using channel state information. Also, in the case of limited feedback (LFB) of precoders, the sumrates can be achieved greater than that can be achieved using conventional chordal distance, if the precoder is selected properly along with receiver combining matrix. Therefore, in this paper, two algorithms are proposed inspired by GA: first, to make the max-SINR robust to initializations: MS-GA, and second, to achieve better sumrates in case of limited feedback: MS-GA-LFB. These optimal sumrates are obtained at the cost of increased computation complexity which is proportional to the population size chosen in the Genetic Algorithm. The simulation results show that the sum rates of the proposed algorithms match with that obtained using brute force approach to find the good initialization.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ANTS.2015.7413649","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this paper, we propose interference alignment (IA) algorithms inspired by Genetic Algorithm (GA). By simulations for (2 × 2, 1)3 system, we observe that the existing max-SINR (MS) algorithm converges to different sumrates for different initializations of precoders. And the initializations for which sumrate is good, cannot be found trivially using channel state information. Also, in the case of limited feedback (LFB) of precoders, the sumrates can be achieved greater than that can be achieved using conventional chordal distance, if the precoder is selected properly along with receiver combining matrix. Therefore, in this paper, two algorithms are proposed inspired by GA: first, to make the max-SINR robust to initializations: MS-GA, and second, to achieve better sumrates in case of limited feedback: MS-GA-LFB. These optimal sumrates are obtained at the cost of increased computation complexity which is proportional to the population size chosen in the Genetic Algorithm. The simulation results show that the sum rates of the proposed algorithms match with that obtained using brute force approach to find the good initialization.
遗传最大sinr干扰对准算法
本文提出了一种受遗传算法启发的干涉对准算法。通过对(2 × 2,1)3系统的仿真,我们发现对于不同的预编码器初始化,现有的max-SINR (MS)算法收敛到不同的求和速率。对于sumrate良好的初始化,不能使用通道状态信息轻松地找到。此外,在预编码器的有限反馈(LFB)情况下,如果正确选择预编码器和接收机组合矩阵,则可以获得比使用常规弦距更大的求和速率。因此,本文在遗传算法的启发下,提出了两种算法:一是使最大sinr对初始化具有鲁棒性的MS-GA算法,二是在有限反馈情况下获得更好的求和率的MS-GA- lfb算法。这些最优求和的代价是计算复杂度的增加,这与遗传算法中选择的种群大小成正比。仿真结果表明,所提算法的和速率与采用暴力破解方法找到良好初始化点的和速率基本一致。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信