基于克隆和自适应代价函数的进化规划在多用户DS-CDMA系统中的应用

Taufik Abrão, Fernando Ciriaco Dias Neto, P. Jeszensky
{"title":"基于克隆和自适应代价函数的进化规划在多用户DS-CDMA系统中的应用","authors":"Taufik Abrão, Fernando Ciriaco Dias Neto, P. Jeszensky","doi":"10.1109/ISSSTA.2004.1371684","DOIUrl":null,"url":null,"abstract":"A new utilization form for the evolutionary programming (EP) algorithm applied to multi-user DS-CDMA (direct sequence code division multiple access) systems in a synchronous AWGN (additive white Gaussian noise) channel is proposed. In order to find the maximum likelihood (ML) solution, the variance matrix for the generation of new candidates was expressed as a function of the following parameters: E/sub b//N/sub 0/; near-far ratio (NFR); cost function (fitness value). A cloning strategy procedure was introduced where the best vectors with the bit-candidates were cloned, reducing drastically the required time for the algorithm convergence to the single user bound (SuB) performance. An improvement in the convergence process was obtained using a parallel interference canceller with soft decision (SD-PIC) for initial vector generation.","PeriodicalId":340769,"journal":{"name":"Eighth IEEE International Symposium on Spread Spectrum Techniques and Applications - Programme and Book of Abstracts (IEEE Cat. No.04TH8738)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Evolutionary programming with cloning and adaptive cost function applied to multi-user DS-CDMA systems\",\"authors\":\"Taufik Abrão, Fernando Ciriaco Dias Neto, P. Jeszensky\",\"doi\":\"10.1109/ISSSTA.2004.1371684\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new utilization form for the evolutionary programming (EP) algorithm applied to multi-user DS-CDMA (direct sequence code division multiple access) systems in a synchronous AWGN (additive white Gaussian noise) channel is proposed. In order to find the maximum likelihood (ML) solution, the variance matrix for the generation of new candidates was expressed as a function of the following parameters: E/sub b//N/sub 0/; near-far ratio (NFR); cost function (fitness value). A cloning strategy procedure was introduced where the best vectors with the bit-candidates were cloned, reducing drastically the required time for the algorithm convergence to the single user bound (SuB) performance. An improvement in the convergence process was obtained using a parallel interference canceller with soft decision (SD-PIC) for initial vector generation.\",\"PeriodicalId\":340769,\"journal\":{\"name\":\"Eighth IEEE International Symposium on Spread Spectrum Techniques and Applications - Programme and Book of Abstracts (IEEE Cat. No.04TH8738)\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-08-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eighth IEEE International Symposium on Spread Spectrum Techniques and Applications - Programme and Book of Abstracts (IEEE Cat. No.04TH8738)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSSTA.2004.1371684\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eighth IEEE International Symposium on Spread Spectrum Techniques and Applications - Programme and Book of Abstracts (IEEE Cat. No.04TH8738)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSSTA.2004.1371684","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

摘要

提出了一种新的进化规划(EP)算法应用于同步加性高斯白噪声信道下多用户直接顺序码分多址(DS-CDMA)系统的应用形式。为了找到最大似然(ML)解,将新候选生成的方差矩阵表示为以下参数的函数:E/sub b//N/sub 0/;近远比;成本函数(适应度值)。引入克隆策略过程,克隆具有候选位的最佳向量,大大减少了算法收敛到单用户绑定(SuB)性能所需的时间。采用带有软判决的并行干涉消去器(SD-PIC)进行初始矢量生成,提高了收敛速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Evolutionary programming with cloning and adaptive cost function applied to multi-user DS-CDMA systems
A new utilization form for the evolutionary programming (EP) algorithm applied to multi-user DS-CDMA (direct sequence code division multiple access) systems in a synchronous AWGN (additive white Gaussian noise) channel is proposed. In order to find the maximum likelihood (ML) solution, the variance matrix for the generation of new candidates was expressed as a function of the following parameters: E/sub b//N/sub 0/; near-far ratio (NFR); cost function (fitness value). A cloning strategy procedure was introduced where the best vectors with the bit-candidates were cloned, reducing drastically the required time for the algorithm convergence to the single user bound (SuB) performance. An improvement in the convergence process was obtained using a parallel interference canceller with soft decision (SD-PIC) for initial vector generation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Capacity of MIMO channels with one-sided correlation Initial phase selection of chaos-based spreading sequences in asynchronous DS-CDMA systems Band-limited frequency efficient orthogonal pulse shape modulation for UWB communications Design of spreading sequences with negative auto-correlations realizable by nonlinear feedback shift registers Adaptive spreading and channel coding gain control and its experimental results in broadband DS-CDMA reverse link
×
引用
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