Cellular capacity maximization via robust downlink beamforming

V. Chebolu, Siddharth Deshmukh
{"title":"Cellular capacity maximization via robust downlink beamforming","authors":"V. Chebolu, Siddharth Deshmukh","doi":"10.1109/ICCSP.2015.7322556","DOIUrl":null,"url":null,"abstract":"In this paper we propose an optimized multi-cell downlink beamforming solution in which our objective is to maximize capacity of a cellular network. We first formulate an optimization problem, maximizing the received signal power of every active user in a cell, subjected to limiting the overall interference observed by other users below a specified level. In addition, we also put constraint on maximum transmit power of the serving base station. Next, in order to compute robust beamforming vector we accommodate channel estimation error in our formulation. We consider channel imperfection as error between true and estimated channel coefficients and we assume error is bounded with in an ellipsoidal set. The resulting formulation is a non-convex optimization problem and to get a tractable solution we exploit linear matrix inequality based S-procedure. The final reformulation is solved by using semi definite relaxation. The efficacy of proposed solution in improving cellular capacity and efficient power transmission is shown by simulations.","PeriodicalId":174192,"journal":{"name":"2015 International Conference on Communications and Signal Processing (ICCSP)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Communications and Signal Processing (ICCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSP.2015.7322556","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper we propose an optimized multi-cell downlink beamforming solution in which our objective is to maximize capacity of a cellular network. We first formulate an optimization problem, maximizing the received signal power of every active user in a cell, subjected to limiting the overall interference observed by other users below a specified level. In addition, we also put constraint on maximum transmit power of the serving base station. Next, in order to compute robust beamforming vector we accommodate channel estimation error in our formulation. We consider channel imperfection as error between true and estimated channel coefficients and we assume error is bounded with in an ellipsoidal set. The resulting formulation is a non-convex optimization problem and to get a tractable solution we exploit linear matrix inequality based S-procedure. The final reformulation is solved by using semi definite relaxation. The efficacy of proposed solution in improving cellular capacity and efficient power transmission is shown by simulations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过稳健的下行波束形成实现蜂窝容量最大化
在本文中,我们提出了一个优化的多小区下行波束形成解决方案,我们的目标是最大限度地提高蜂窝网络的容量。我们首先制定了一个优化问题,在限制其他用户观察到的总体干扰低于指定水平的情况下,最大限度地提高小区中每个活跃用户的接收信号功率。此外,我们还对服务基站的最大发射功率进行了约束。其次,为了计算鲁棒波束形成矢量,我们在公式中考虑了信道估计误差。我们将信道缺陷视为信道系数的真实值与估计值之间的误差,并假设误差在椭球集中有界。所得公式是一个非凸优化问题,为了得到一个易于处理的解,我们利用基于线性矩阵不等式的s -过程。最后用半定松弛法求解。仿真结果表明了该方案在提高蜂窝容量和高效传输功率方面的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Improved scheduling algorithm using dynamic tree construction for wireless sensor networks Design of polyphase FIR filter using bypass feed direct multiplier Implementation of floating point fused basic arithmetic module using Verilog Comparison of conventional flip flops with pulse triggered generation using signal feed through technique A novel 2GHz highly efficiency improved class-E Power Amplifier for Base stations
×
引用
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