Improving the initial convergence of adaptive filters: variable-length LMS algorithms

V. Nascimento
{"title":"Improving the initial convergence of adaptive filters: variable-length LMS algorithms","authors":"V. Nascimento","doi":"10.1109/ICDSP.2002.1028179","DOIUrl":null,"url":null,"abstract":"Despite its qualities of robustness, low cost, and good tracking performance, in many situations the LMS algorithm suffers from slow initial convergence. We propose a method to speed up this convergence rate by varying the length of the adaptive filter, taking advantage of the larger step-sizes allowed for short filters. The results presented here show that variable-length adaptive filters have the potential to achieve quite fast convergence rates, with a modest increase in the computational complexity.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDSP.2002.1028179","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28

Abstract

Despite its qualities of robustness, low cost, and good tracking performance, in many situations the LMS algorithm suffers from slow initial convergence. We propose a method to speed up this convergence rate by varying the length of the adaptive filter, taking advantage of the larger step-sizes allowed for short filters. The results presented here show that variable-length adaptive filters have the potential to achieve quite fast convergence rates, with a modest increase in the computational complexity.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
改进自适应滤波器的初始收敛性:变长LMS算法
尽管LMS算法具有鲁棒性、低成本和良好的跟踪性能,但在许多情况下存在初始收敛缓慢的问题。我们提出了一种通过改变自适应滤波器的长度来加快这种收敛速度的方法,利用了短滤波器允许的较大步长。本文给出的结果表明,变长自适应滤波器具有实现相当快的收敛速度的潜力,计算复杂度适度增加。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
H/sub /spl infin// bounded optimal updating - down-dating algorithm A systematic approach to seizure prediction using genetic and classifier based feature selection A prognostic-classification system based on a probabilistic NN for predicting urine bladder cancer recurrence Implementation of real-time AMDF pitch-detection for voice gender normalisation Fourier filtering of continuous global surfaces
×
引用
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