可变步长修改的剪切LMS算法

Amin Aref, M. Lotfizad
{"title":"可变步长修改的剪切LMS算法","authors":"Amin Aref, M. Lotfizad","doi":"10.1109/KBEI.2015.7436103","DOIUrl":null,"url":null,"abstract":"In this paper we introduce an Modified Clipped LMS (MCLMS) algorithm with a variable step size. In the MCLMS algorithm two parameters, the step size and the threshold control the convergence rate of the adaptive filter coefficients and also determine the final mean-square error. The computational complexity decreased dramatically by a large threshold. However, this selection results in a low convergence rate. Since the convergence time is inversely proportional to the step size, a large step size is often selected for fast convergence. But a large step size results in an increased final mean square error. Therefore in this paper we choose a large threshold and propose a variable step size for the MCLMS algorithm. The advantages of this proposed variable step size and a large threshold selection are that the computation complexity is low, final mean square error is low and that the convergence is fast.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Variable step size modified clipped LMS algorithm\",\"authors\":\"Amin Aref, M. Lotfizad\",\"doi\":\"10.1109/KBEI.2015.7436103\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we introduce an Modified Clipped LMS (MCLMS) algorithm with a variable step size. In the MCLMS algorithm two parameters, the step size and the threshold control the convergence rate of the adaptive filter coefficients and also determine the final mean-square error. The computational complexity decreased dramatically by a large threshold. However, this selection results in a low convergence rate. Since the convergence time is inversely proportional to the step size, a large step size is often selected for fast convergence. But a large step size results in an increased final mean square error. Therefore in this paper we choose a large threshold and propose a variable step size for the MCLMS algorithm. The advantages of this proposed variable step size and a large threshold selection are that the computation complexity is low, final mean square error is low and that the convergence is fast.\",\"PeriodicalId\":168295,\"journal\":{\"name\":\"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/KBEI.2015.7436103\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KBEI.2015.7436103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

本文介绍了一种可变步长的改进剪切LMS (MCLMS)算法。在MCLMS算法中,步长和阈值两个参数控制了自适应滤波系数的收敛速度,也决定了最终的均方误差。计算复杂度显著降低了一个较大的阈值。然而,这种选择导致了较低的收敛速度。由于收敛时间与步长成反比,为了快速收敛,通常选择较大的步长。但较大的步长会导致最终均方误差增大。因此,本文选择一个较大的阈值,并提出一个可变步长的MCLMS算法。这种变步长和大阈值选择的优点是计算复杂度低,最终均方误差小,收敛速度快。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Variable step size modified clipped LMS algorithm
In this paper we introduce an Modified Clipped LMS (MCLMS) algorithm with a variable step size. In the MCLMS algorithm two parameters, the step size and the threshold control the convergence rate of the adaptive filter coefficients and also determine the final mean-square error. The computational complexity decreased dramatically by a large threshold. However, this selection results in a low convergence rate. Since the convergence time is inversely proportional to the step size, a large step size is often selected for fast convergence. But a large step size results in an increased final mean square error. Therefore in this paper we choose a large threshold and propose a variable step size for the MCLMS algorithm. The advantages of this proposed variable step size and a large threshold selection are that the computation complexity is low, final mean square error is low and that the convergence is fast.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信