Fast genetic algorithm for bits allocation in OFDM based cognitive radio systems

Mindi Yuan, Shaowei Wang, S. Du
{"title":"Fast genetic algorithm for bits allocation in OFDM based cognitive radio systems","authors":"Mindi Yuan, Shaowei Wang, S. Du","doi":"10.1109/WOCC.2010.5510609","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a fast genetic algorithm (FGA) for bits allocation in OFDM based cognitive radio systems. The bits allocation in OFDM subchannels is modeled as a binary sequences search problem, which is NP-Hard. First, the bits with the least cost in each subchannel are formulated as a possible solution with a predefined probability. Then a genetic-like algorithm is used to search the current local optima, which have the most allocated bits. The algorithm terminates until the total power is consumed or the mutual interference is over-the-threshold. Simulation results show that the performance of FGA is close to the optimal solution obtained by commercial software.","PeriodicalId":427398,"journal":{"name":"The 19th Annual Wireless and Optical Communications Conference (WOCC 2010)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 19th Annual Wireless and Optical Communications Conference (WOCC 2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOCC.2010.5510609","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper, we propose a fast genetic algorithm (FGA) for bits allocation in OFDM based cognitive radio systems. The bits allocation in OFDM subchannels is modeled as a binary sequences search problem, which is NP-Hard. First, the bits with the least cost in each subchannel are formulated as a possible solution with a predefined probability. Then a genetic-like algorithm is used to search the current local optima, which have the most allocated bits. The algorithm terminates until the total power is consumed or the mutual interference is over-the-threshold. Simulation results show that the performance of FGA is close to the optimal solution obtained by commercial software.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于OFDM认知无线电系统位分配的快速遗传算法
本文提出了一种基于OFDM认知无线电系统的快速遗传算法(FGA)。将OFDM子信道中的位分配建模为一个NP-Hard的二进制序列搜索问题。首先,将每个子通道中代价最小的比特表示为具有预定义概率的可能解。然后使用一种类似遗传的算法来搜索具有最多分配位的当前局部最优。算法终止,直到总功率被消耗或相互干扰超过阈值。仿真结果表明,该算法的性能与商业软件得到的最优解接近。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A game algorithm of dynamic spectrum allocation based on spectrum difference Inter-FE Topology Discovery and maintenance technology on ForCES routers Dispersion characteristics of terahertz photonic crystal waveguide TDMA for primary users and CSMA for secondary users in a cognitive radio network Game-based modeling of node cooperation in Ad Hoc networks
×
引用
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