认知CDMA网络中干扰最小化编码分配的蚁群优化方法

Mahsa Shafiee, A. J. Jahromi, H. Nia, Negin Sokhandan
{"title":"认知CDMA网络中干扰最小化编码分配的蚁群优化方法","authors":"Mahsa Shafiee, A. J. Jahromi, H. Nia, Negin Sokhandan","doi":"10.1109/SARNOF.2011.5876441","DOIUrl":null,"url":null,"abstract":"In this paper we focus on the problem of code assignment to cognitive users in a synchronous underlay network using Code Division Multiple Access (CDMA) scheme. No knowledge of the spreading codes used by the primary CDMA network is available to the cooperative secondary users a priori, other than the spreading factor. An evolutionary algorithm of relatively low complexity order is proposed based on Ant Colony Optimization (ACO) for assigning spreading codes to secondary users such that the mutual interference between existing secondary and primary users is minimized. This is accomplished at the secondary fusion center by minimizing the mean square cross-correlation between the candidate codes and the matrix which includes all independently received signals by the cooperative secondary users. Simulation results show that performance of the ACO-based method can converge to the optimal interference minimizing code assignment method while the complexity order is significantly reduced.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Ant Colony Optimization approach to interference minimizing code assignment in cognitive CDMA networks\",\"authors\":\"Mahsa Shafiee, A. J. Jahromi, H. Nia, Negin Sokhandan\",\"doi\":\"10.1109/SARNOF.2011.5876441\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we focus on the problem of code assignment to cognitive users in a synchronous underlay network using Code Division Multiple Access (CDMA) scheme. No knowledge of the spreading codes used by the primary CDMA network is available to the cooperative secondary users a priori, other than the spreading factor. An evolutionary algorithm of relatively low complexity order is proposed based on Ant Colony Optimization (ACO) for assigning spreading codes to secondary users such that the mutual interference between existing secondary and primary users is minimized. This is accomplished at the secondary fusion center by minimizing the mean square cross-correlation between the candidate codes and the matrix which includes all independently received signals by the cooperative secondary users. Simulation results show that performance of the ACO-based method can converge to the optimal interference minimizing code assignment method while the complexity order is significantly reduced.\",\"PeriodicalId\":339596,\"journal\":{\"name\":\"34th IEEE Sarnoff Symposium\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"34th IEEE Sarnoff Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SARNOF.2011.5876441\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"34th IEEE Sarnoff Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SARNOF.2011.5876441","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

本文研究了基于码分多址(CDMA)的同步底层网络中认知用户的编码分配问题。除了扩展因子外,合作的次要用户先验地不知道主CDMA网络所使用的扩展码。提出了一种基于蚁群算法的相对低复杂度阶进化算法,用于向二级用户分配扩频码,使现有二级用户与主用户之间的相互干扰最小化。这是通过最小化候选码与矩阵之间的均方互关来实现的,矩阵包含了合作的次要用户独立接收的所有信号。仿真结果表明,基于蚁群算法的编码分配方法性能收敛于最优干扰最小化编码分配方法,且复杂度阶数显著降低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Ant Colony Optimization approach to interference minimizing code assignment in cognitive CDMA networks
In this paper we focus on the problem of code assignment to cognitive users in a synchronous underlay network using Code Division Multiple Access (CDMA) scheme. No knowledge of the spreading codes used by the primary CDMA network is available to the cooperative secondary users a priori, other than the spreading factor. An evolutionary algorithm of relatively low complexity order is proposed based on Ant Colony Optimization (ACO) for assigning spreading codes to secondary users such that the mutual interference between existing secondary and primary users is minimized. This is accomplished at the secondary fusion center by minimizing the mean square cross-correlation between the candidate codes and the matrix which includes all independently received signals by the cooperative secondary users. Simulation results show that performance of the ACO-based method can converge to the optimal interference minimizing code assignment method while the complexity order is significantly reduced.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Adaptive multiresolution modulation for multimedia traffic in dynamic wireless environment mmWave mobile broadband (MMB): Unleashing the 3–300GHz spectrum Allocating bandwidth in the resilient packet ring networks by PI controller Single edge based belief propagation algorithms for MIMO detection Bit error rate analysis of digital communications signal demodulation using wavelet denoising
×
引用
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