基于ofdma认知无线电系统的满载波功率分配

T. L. Van, Hieu Dinh Chi, Kinh Nguyen Viet, Hieu Nguyen Thanh
{"title":"基于ofdma认知无线电系统的满载波功率分配","authors":"T. L. Van, Hieu Dinh Chi, Kinh Nguyen Viet, Hieu Nguyen Thanh","doi":"10.4236/WET.2014.51002","DOIUrl":null,"url":null,"abstract":"When implementing an appropriate windowing, the interference from a Cognitive Radio (CR) system to licensed systems (primary users) will be significantly reduced. Consequently, power allocated to subcarriers can be increased, especially subcarriers having far spectral distance to primary user bands can be allocated full of its maximum possible power. In this paper, we propose a new class of sub-optimal subcarrier power allocation algorithm that significantly reduces complexity of OFDMA-based CR systems. Two sub-optimal proposals, called Pre-set Filling Range (PFR) and Maximum Filling Range (MFR) are studied. Investigations show that this new power allocating algorithm allows CR systems obtain high throughput while retaining low complexity.","PeriodicalId":68067,"journal":{"name":"无线工程与技术(英文)","volume":"5 1","pages":"11-18"},"PeriodicalIF":0.0000,"publicationDate":"2014-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Full-Filling Subcarrier Power Allocation in OFDMA-Based Cognitive Radio Systems\",\"authors\":\"T. L. Van, Hieu Dinh Chi, Kinh Nguyen Viet, Hieu Nguyen Thanh\",\"doi\":\"10.4236/WET.2014.51002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When implementing an appropriate windowing, the interference from a Cognitive Radio (CR) system to licensed systems (primary users) will be significantly reduced. Consequently, power allocated to subcarriers can be increased, especially subcarriers having far spectral distance to primary user bands can be allocated full of its maximum possible power. In this paper, we propose a new class of sub-optimal subcarrier power allocation algorithm that significantly reduces complexity of OFDMA-based CR systems. Two sub-optimal proposals, called Pre-set Filling Range (PFR) and Maximum Filling Range (MFR) are studied. Investigations show that this new power allocating algorithm allows CR systems obtain high throughput while retaining low complexity.\",\"PeriodicalId\":68067,\"journal\":{\"name\":\"无线工程与技术(英文)\",\"volume\":\"5 1\",\"pages\":\"11-18\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-01-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"无线工程与技术(英文)\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.4236/WET.2014.51002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"无线工程与技术(英文)","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.4236/WET.2014.51002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

当实现适当的窗口时,认知无线电(CR)系统对许可系统(主用户)的干扰将大大减少。因此,可以增加分配给子载波的功率,特别是与主用户频带频谱距离较远的子载波可以充分分配其最大可能功率。在本文中,我们提出了一类新的次优子载波功率分配算法,该算法显著降低了基于ofdma的CR系统的复杂度。研究了预设填充范围(PFR)和最大填充范围(MFR)两种次优方案。研究表明,这种新的功率分配算法可以使CR系统在保持低复杂度的同时获得高吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Full-Filling Subcarrier Power Allocation in OFDMA-Based Cognitive Radio Systems
When implementing an appropriate windowing, the interference from a Cognitive Radio (CR) system to licensed systems (primary users) will be significantly reduced. Consequently, power allocated to subcarriers can be increased, especially subcarriers having far spectral distance to primary user bands can be allocated full of its maximum possible power. In this paper, we propose a new class of sub-optimal subcarrier power allocation algorithm that significantly reduces complexity of OFDMA-based CR systems. Two sub-optimal proposals, called Pre-set Filling Range (PFR) and Maximum Filling Range (MFR) are studied. Investigations show that this new power allocating algorithm allows CR systems obtain high throughput while retaining low complexity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
118
×
引用
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学术官方微信