Blind channel identification using evolutionary programming

C. Kalluri, S.S. Rao, S. Nelatury
{"title":"Blind channel identification using evolutionary programming","authors":"C. Kalluri, S.S. Rao, S. Nelatury","doi":"10.1109/ACSSC.2000.910756","DOIUrl":null,"url":null,"abstract":"The problem of blind channel identification involves estimation of the channel coefficients based on the received noisy signal. The coefficients are estimated by using higher order cumulant fitting of the received signal. The optimization of the cumulant-fitting cost function is a multimodal problem, and conventional approaches using gradient algorithms often involve local optima in the absence of a good initial estimate. We use evolutionary algorithms which evolve towards better regions of search space by means of randomized processes of selection and variation, to optimize the cost function. The effectiveness of genetic algorithms as well as evolutionary programming using self-adaptive mutation as stochastic optimization techniques is studied, and the results presented for the blind channel identification problem.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"45 1","pages":"1212-1216 vol.2"},"PeriodicalIF":0.0000,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2000.910756","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The problem of blind channel identification involves estimation of the channel coefficients based on the received noisy signal. The coefficients are estimated by using higher order cumulant fitting of the received signal. The optimization of the cumulant-fitting cost function is a multimodal problem, and conventional approaches using gradient algorithms often involve local optima in the absence of a good initial estimate. We use evolutionary algorithms which evolve towards better regions of search space by means of randomized processes of selection and variation, to optimize the cost function. The effectiveness of genetic algorithms as well as evolutionary programming using self-adaptive mutation as stochastic optimization techniques is studied, and the results presented for the blind channel identification problem.
采用进化规划的盲信道识别
盲信道识别问题是根据接收到的噪声信号估计信道系数。利用接收信号的高阶累积量拟合来估计系数。累积拟合代价函数的优化是一个多模态问题,在缺乏良好初始估计的情况下,使用梯度算法的传统方法往往涉及局部最优。我们使用进化算法,通过随机选择和变异过程向更好的搜索空间区域进化,以优化成本函数。研究了遗传算法和以自适应突变为随机优化技术的进化规划的有效性,并给出了盲信道识别问题的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信