一种加速恒模算法

Magno T. M. Silva, M. Gerken, M. D. Miranda
{"title":"一种加速恒模算法","authors":"Magno T. M. Silva, M. Gerken, M. D. Miranda","doi":"10.14209/its.2002.405","DOIUrl":null,"url":null,"abstract":"— We present a novel adaptive algorithm for blind equalization. It is based on a tuner used in adaptive control that sets the second derivative of the parameter estimates and minimizes the cost function introduced by Go- dard. Based on simulation results we present a comparison with the Constant Modulus and the Shalvi-Weinstein algorithms. Both the convergence speed and the computational complexity of the proposed algorithm lie between those of the Constant Modulus and the Shalvi-Weinstein algorithms, thus present- ing a more favorable compromise between convergence speed and computational complexity. Some preliminary results also suggest that the proposed al- gorithm presents a more robust behavior with respect to convergence to global minima.","PeriodicalId":310988,"journal":{"name":"Anais do 2002 International Telecommunications Symposium","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Accelerated Constant Modulus Algorithm\",\"authors\":\"Magno T. M. Silva, M. Gerken, M. D. Miranda\",\"doi\":\"10.14209/its.2002.405\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"— We present a novel adaptive algorithm for blind equalization. It is based on a tuner used in adaptive control that sets the second derivative of the parameter estimates and minimizes the cost function introduced by Go- dard. Based on simulation results we present a comparison with the Constant Modulus and the Shalvi-Weinstein algorithms. Both the convergence speed and the computational complexity of the proposed algorithm lie between those of the Constant Modulus and the Shalvi-Weinstein algorithms, thus present- ing a more favorable compromise between convergence speed and computational complexity. Some preliminary results also suggest that the proposed al- gorithm presents a more robust behavior with respect to convergence to global minima.\",\"PeriodicalId\":310988,\"journal\":{\"name\":\"Anais do 2002 International Telecommunications Symposium\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Anais do 2002 International Telecommunications Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14209/its.2002.405\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Anais do 2002 International Telecommunications Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14209/its.2002.405","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

提出了一种新的自适应盲均衡算法。它基于自适应控制中使用的调谐器,该调谐器设置参数估计的二阶导数并最小化Go- ard引入的代价函数。基于仿真结果,我们给出了与常模和Shalvi-Weinstein算法的比较。该算法的收敛速度和计算复杂度均介于常模算法和Shalvi-Weinstein算法之间,从而在收敛速度和计算复杂度之间呈现出更有利的折衷。一些初步结果还表明,该算法在收敛到全局极小值方面具有更强的鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Accelerated Constant Modulus Algorithm
— We present a novel adaptive algorithm for blind equalization. It is based on a tuner used in adaptive control that sets the second derivative of the parameter estimates and minimizes the cost function introduced by Go- dard. Based on simulation results we present a comparison with the Constant Modulus and the Shalvi-Weinstein algorithms. Both the convergence speed and the computational complexity of the proposed algorithm lie between those of the Constant Modulus and the Shalvi-Weinstein algorithms, thus present- ing a more favorable compromise between convergence speed and computational complexity. Some preliminary results also suggest that the proposed al- gorithm presents a more robust behavior with respect to convergence to global minima.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信