{"title":"基于OFDM认知无线电系统位分配的快速遗传算法","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":"{\"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}","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}
Fast genetic algorithm for bits allocation in OFDM based cognitive radio systems
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
