Weighted sum rate maximization for cognitive MISO broadcast channel: Large system analysis

Y. He, S. Dey
{"title":"Weighted sum rate maximization for cognitive MISO broadcast channel: Large system analysis","authors":"Y. He, S. Dey","doi":"10.1109/ICASSP.2013.6638587","DOIUrl":null,"url":null,"abstract":"This paper considers the ergodic weighted sum rate (WSR) maximization problem for an underlay cognitive radio MISO broadcast channel, where a secondary network, consisting of a base-station with M transmit antennas and K single-antenna secondary users (SUs), is allowed to share the same spectrum with a primary user (PU), under an average transmit sum power (ATTP) constraint Pav and an average interference power (AIP) constraint on the PU. We show that the ATTP constraint is always active, and as Pav → ∞, the ergodic WSR approaches infinity similar to the conventional non-CR network case. A low-complexity suboptimal beamforming scheme (called partially-projected regularized zero-forcing beamforming `PP-RZFBF') with a closed-form beamformer is proposed. Due to the non-convexity of PP-RZFBF scheme, a large system analysis is conducted in the limit as M and K approach infinity with a fixed finite ratio r = K/M. We derive deterministic limiting approximations for the PP-RZFBF problem which enables us to determine asymptotically optimal beamformers for PP-RZFBF. Numerical simulations illustrate that the asymptotically optimal beamformers turn out to be quite effective even for small M, K.","PeriodicalId":183968,"journal":{"name":"2013 IEEE International Conference on Acoustics, Speech and Signal Processing","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Acoustics, Speech and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.2013.6638587","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

This paper considers the ergodic weighted sum rate (WSR) maximization problem for an underlay cognitive radio MISO broadcast channel, where a secondary network, consisting of a base-station with M transmit antennas and K single-antenna secondary users (SUs), is allowed to share the same spectrum with a primary user (PU), under an average transmit sum power (ATTP) constraint Pav and an average interference power (AIP) constraint on the PU. We show that the ATTP constraint is always active, and as Pav → ∞, the ergodic WSR approaches infinity similar to the conventional non-CR network case. A low-complexity suboptimal beamforming scheme (called partially-projected regularized zero-forcing beamforming `PP-RZFBF') with a closed-form beamformer is proposed. Due to the non-convexity of PP-RZFBF scheme, a large system analysis is conducted in the limit as M and K approach infinity with a fixed finite ratio r = K/M. We derive deterministic limiting approximations for the PP-RZFBF problem which enables us to determine asymptotically optimal beamformers for PP-RZFBF. Numerical simulations illustrate that the asymptotically optimal beamformers turn out to be quite effective even for small M, K.
认知MISO广播信道加权和速率最大化:大系统分析
在平均发射和功率(ATTP)约束Pav和平均干扰功率(AIP)约束下,允许由具有M个发射天线的基站和K个单天线辅助用户(su)组成的辅助网络与主用户(PU)共享同一频谱,本文考虑了底层认知无线电MISO广播信道的遍历加权和速率(WSR)最大化问题。我们证明了ATTP约束总是有效的,并且当Pav→∞时,遍历WSR接近于无穷大,类似于传统的非cr网络情况。提出了一种基于封闭波束形成器的低复杂度次优波束形成方案(部分投射正则化零强迫波束形成PP-RZFBF)。由于PP-RZFBF格式的非凸性,在M和K趋近于无穷时,以固定的有限比r = K/M进行了大的系统分析。我们导出了PP-RZFBF问题的确定性极限近似,使我们能够确定PP-RZFBF的渐近最优波束形成器。数值模拟表明,渐近最优波束形成器即使对于较小的M, K也是相当有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信