Ergodic capacity for fading channels in cognitive radio networks

Raouia Masmoudi
{"title":"Ergodic capacity for fading channels in cognitive radio networks","authors":"Raouia Masmoudi","doi":"10.1109/ATSIP.2018.8364519","DOIUrl":null,"url":null,"abstract":"In this paper, we consider a Cognitive Radio (CR) system where two type of users try to access to the primary spectrum : a primary user (PU) owning the spectrum license and a secondary user (SU) who does not own the spectrum license. However, the secondary communication is allowed to coexist with the primary communication as long as the interference caused by SU to PU is below a tolerable threshold. We study the optimization problem which maximizes the SU's achievable ergodic capacity under different types of power constraints and for different fading channel models. Our goal is to calculate the optimal power allocation strategies for these optimization problems. We show that modelling with Rayleigh fading for the channel between SU transmitter and PU receiver is an advantageous way to ameliorate the SU ergodic capacity. Furthermore, we consider four combinations of power constraints, since the interference power constraint and the transmit power constraint can be restricted by a peak or an average threshold. We also show that the SU ergodic capacity under average transmit power constraint and average interference power constraint outperforms the one with peak power constraints. In this case, we propose a novel decoupling method. Our method reduces the complexity of the initial problem and makes our initial problem easier to solve.","PeriodicalId":332253,"journal":{"name":"2018 4th International Conference on Advanced Technologies for Signal and Image Processing (ATSIP)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 4th International Conference on Advanced Technologies for Signal and Image Processing (ATSIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATSIP.2018.8364519","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper, we consider a Cognitive Radio (CR) system where two type of users try to access to the primary spectrum : a primary user (PU) owning the spectrum license and a secondary user (SU) who does not own the spectrum license. However, the secondary communication is allowed to coexist with the primary communication as long as the interference caused by SU to PU is below a tolerable threshold. We study the optimization problem which maximizes the SU's achievable ergodic capacity under different types of power constraints and for different fading channel models. Our goal is to calculate the optimal power allocation strategies for these optimization problems. We show that modelling with Rayleigh fading for the channel between SU transmitter and PU receiver is an advantageous way to ameliorate the SU ergodic capacity. Furthermore, we consider four combinations of power constraints, since the interference power constraint and the transmit power constraint can be restricted by a peak or an average threshold. We also show that the SU ergodic capacity under average transmit power constraint and average interference power constraint outperforms the one with peak power constraints. In this case, we propose a novel decoupling method. Our method reduces the complexity of the initial problem and makes our initial problem easier to solve.
认知无线电网络中衰落信道的遍历容量
在本文中,我们考虑了一个认知无线电(CR)系统,其中两种类型的用户试图访问主频谱:拥有频谱许可证的主用户(PU)和不拥有频谱许可证的辅助用户(SU)。但是,只要SU对PU造成的干扰低于可容忍的阈值,则允许二次通信与主通信共存。研究了在不同类型的功率约束和不同衰落信道模型下,最大限度地提高SU可达遍历容量的优化问题。我们的目标是计算这些优化问题的最优功率分配策略。研究表明,利用瑞利衰落对SU发射机和PU接收机之间的信道进行建模是改善SU遍历容量的一种有利方法。此外,我们考虑了四种功率约束的组合,因为干扰功率约束和发射功率约束可以由峰值或平均阈值限制。在平均发射功率约束和平均干扰功率约束下,SU遍历容量优于峰值功率约束下的遍历容量。在这种情况下,我们提出了一种新的解耦方法。我们的方法降低了初始问题的复杂性,使初始问题更容易求解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信