用重加权最小范数法设计干涉对准波束形成器

G. Sridharan, Wei Yu
{"title":"用重加权最小范数法设计干涉对准波束形成器","authors":"G. Sridharan, Wei Yu","doi":"10.1109/SPAWC.2014.6941890","DOIUrl":null,"url":null,"abstract":"This paper proposes an algorithm to compute the uplink transmit beamformers for linear interference alignment in MIMO cellular networks without symbol extensions. In particular, we consider interference alignment in a network consisting of G cells and K users/cell, having N and M antennas at each base station (BS) and user respectively. Using an alternate interpretation of the conditions for interference alignment, we frame the problem of finding aligned transmit beamformers in the uplink as an optimization problem to minimize the rank of a set of interference matrices subject to affine constraints. The interference matrix of a BS consists of all the interfering vectors at that BS. The proposed algorithm approximates rank using the weighted Frobenius norm and iteratively updates the weights so that the weighted Frobenius norm is a close approximation of the rank of the interference matrix. A crucial aspect of this algorithm is the weight update rule that guides the algorithm towards aligned beamformers. We propose a novel weight update rule that discourages the algorithm from converging to local minima that do not generate the requisite number of interference free dimensions. The proposed algorithm is computationally efficient since it only requires solving a simple quadratic program in each iteration. Simulation results indicate much faster convergence to aligned beamformers when compared to algorithms of similar complexity.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"231 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Beamformer design for interference alignment using reweighted frobenius norm minimization\",\"authors\":\"G. Sridharan, Wei Yu\",\"doi\":\"10.1109/SPAWC.2014.6941890\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an algorithm to compute the uplink transmit beamformers for linear interference alignment in MIMO cellular networks without symbol extensions. In particular, we consider interference alignment in a network consisting of G cells and K users/cell, having N and M antennas at each base station (BS) and user respectively. Using an alternate interpretation of the conditions for interference alignment, we frame the problem of finding aligned transmit beamformers in the uplink as an optimization problem to minimize the rank of a set of interference matrices subject to affine constraints. The interference matrix of a BS consists of all the interfering vectors at that BS. The proposed algorithm approximates rank using the weighted Frobenius norm and iteratively updates the weights so that the weighted Frobenius norm is a close approximation of the rank of the interference matrix. A crucial aspect of this algorithm is the weight update rule that guides the algorithm towards aligned beamformers. We propose a novel weight update rule that discourages the algorithm from converging to local minima that do not generate the requisite number of interference free dimensions. The proposed algorithm is computationally efficient since it only requires solving a simple quadratic program in each iteration. Simulation results indicate much faster convergence to aligned beamformers when compared to algorithms of similar complexity.\",\"PeriodicalId\":420837,\"journal\":{\"name\":\"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)\",\"volume\":\"231 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPAWC.2014.6941890\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2014.6941890","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

提出了一种无符号扩展MIMO蜂窝网络中用于线性干扰对准的上行发射波束形成计算算法。特别地,我们考虑由G个基站和K个用户/基站组成的网络中的干扰对准,每个基站(BS)和用户分别有N和M个天线。利用对干扰对准条件的另一种解释,我们将在上行链路中寻找对准的发射波束形成器的问题框架为一个优化问题,以最小化受仿射约束的一组干扰矩阵的秩。一个分点的干涉矩阵由该分点的所有干涉向量组成。该算法使用加权Frobenius范数逼近秩,并迭代更新权值,使加权Frobenius范数接近干涉矩阵的秩。该算法的一个关键方面是权重更新规则,该规则引导算法朝向对齐波束形成器。我们提出了一种新的权重更新规则,防止算法收敛到局部最小值,而局部最小值不能产生必要的无干涉维数。该算法在每次迭代中只需要求解一个简单的二次规划,计算效率高。仿真结果表明,与相似复杂度的算法相比,对准波束形成算法的收敛速度要快得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Beamformer design for interference alignment using reweighted frobenius norm minimization
This paper proposes an algorithm to compute the uplink transmit beamformers for linear interference alignment in MIMO cellular networks without symbol extensions. In particular, we consider interference alignment in a network consisting of G cells and K users/cell, having N and M antennas at each base station (BS) and user respectively. Using an alternate interpretation of the conditions for interference alignment, we frame the problem of finding aligned transmit beamformers in the uplink as an optimization problem to minimize the rank of a set of interference matrices subject to affine constraints. The interference matrix of a BS consists of all the interfering vectors at that BS. The proposed algorithm approximates rank using the weighted Frobenius norm and iteratively updates the weights so that the weighted Frobenius norm is a close approximation of the rank of the interference matrix. A crucial aspect of this algorithm is the weight update rule that guides the algorithm towards aligned beamformers. We propose a novel weight update rule that discourages the algorithm from converging to local minima that do not generate the requisite number of interference free dimensions. The proposed algorithm is computationally efficient since it only requires solving a simple quadratic program in each iteration. Simulation results indicate much faster convergence to aligned beamformers when compared to algorithms of similar complexity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信