不完全信道知识下受干扰干扰概率约束的底层认知海量MIMO网络

Rama Gupta, Salil Kashyap, E. V. Pothan
{"title":"不完全信道知识下受干扰干扰概率约束的底层认知海量MIMO网络","authors":"Rama Gupta, Salil Kashyap, E. V. Pothan","doi":"10.1109/NCC.2019.8732203","DOIUrl":null,"url":null,"abstract":"We investigate the use of massive number of antennas at the cognitive base station (BS) in reducing interference caused to primary users (PUs) under imperfect channel knowledge without deteriorating the data rate provided to the cognitive user (CU). To this end, we develop a simple back-off factor based power adaptation policy for the cognitive BS which ensures that its transmissions do not violate the interference violation probability constraint at the PUs. We derive a new lower bound on the complement of the interference violation probability and also deduce a lower bound on the achievable rate of the CU when the cognitive BS has an imperfect estimate of its channels to the PUs and the CU. Through our analytical and numerical results, we quantify that the interference violation probability at the PUs can be reduced while providing a fixed data rate to the CU by deploying more number of cognitive BS antennas. Furthermore, if the number of PUs in the network increase, we show that the interference violation probability at the PUs and the data rate of the CU can be maintained at the same level by increasing the number of antennas at the cognitive BS.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"39 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Interference Violation Probability Constrained Underlay Cognitive Massive MIMO Network Under Imperfect Channel Knowledge\",\"authors\":\"Rama Gupta, Salil Kashyap, E. V. Pothan\",\"doi\":\"10.1109/NCC.2019.8732203\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the use of massive number of antennas at the cognitive base station (BS) in reducing interference caused to primary users (PUs) under imperfect channel knowledge without deteriorating the data rate provided to the cognitive user (CU). To this end, we develop a simple back-off factor based power adaptation policy for the cognitive BS which ensures that its transmissions do not violate the interference violation probability constraint at the PUs. We derive a new lower bound on the complement of the interference violation probability and also deduce a lower bound on the achievable rate of the CU when the cognitive BS has an imperfect estimate of its channels to the PUs and the CU. Through our analytical and numerical results, we quantify that the interference violation probability at the PUs can be reduced while providing a fixed data rate to the CU by deploying more number of cognitive BS antennas. Furthermore, if the number of PUs in the network increase, we show that the interference violation probability at the PUs and the data rate of the CU can be maintained at the same level by increasing the number of antennas at the cognitive BS.\",\"PeriodicalId\":6870,\"journal\":{\"name\":\"2019 National Conference on Communications (NCC)\",\"volume\":\"39 1\",\"pages\":\"1-6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 National Conference on Communications (NCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCC.2019.8732203\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2019.8732203","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

我们研究了在认知基站(BS)中使用大量天线在不完全信道知识情况下减少对主要用户(pu)造成的干扰,同时不降低提供给认知用户(CU)的数据速率。为此,我们开发了一种简单的基于回退因子的认知BS功率适应策略,以确保其传输不违反pu处的干扰违反概率约束。我们推导了一个新的干扰违反概率补的下界,并推导了认知BS对其到pu和CU的信道有不完全估计时CU的可实现率的下界。通过我们的分析和数值结果,我们量化了通过部署更多的认知BS天线,可以在向CU提供固定数据速率的同时降低pu的干扰冲突概率。此外,当网络中的pu数量增加时,我们证明了通过增加认知BS的天线数量可以使pu的干扰违反概率和CU的数据速率保持在相同的水平。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Interference Violation Probability Constrained Underlay Cognitive Massive MIMO Network Under Imperfect Channel Knowledge
We investigate the use of massive number of antennas at the cognitive base station (BS) in reducing interference caused to primary users (PUs) under imperfect channel knowledge without deteriorating the data rate provided to the cognitive user (CU). To this end, we develop a simple back-off factor based power adaptation policy for the cognitive BS which ensures that its transmissions do not violate the interference violation probability constraint at the PUs. We derive a new lower bound on the complement of the interference violation probability and also deduce a lower bound on the achievable rate of the CU when the cognitive BS has an imperfect estimate of its channels to the PUs and the CU. Through our analytical and numerical results, we quantify that the interference violation probability at the PUs can be reduced while providing a fixed data rate to the CU by deploying more number of cognitive BS antennas. Furthermore, if the number of PUs in the network increase, we show that the interference violation probability at the PUs and the data rate of the CU can be maintained at the same level by increasing the number of antennas at the cognitive BS.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信