一种新的快速收敛自适应算法

2007 International Conference on Signal Processing, Communications and Networking Pub Date : 2007-11-05 DOI:10.1109/ICSCN.2007.350719

P. Palanisamy, N. Kalyanasundaram

{"title":"一种新的快速收敛自适应算法","authors":"P. Palanisamy, N. Kalyanasundaram","doi":"10.1109/ICSCN.2007.350719","DOIUrl":null,"url":null,"abstract":"In this paper, a new fast convergence adaptive algorithm with variable step size is proposed for FIR adaptive filter. This new proposed algorithm is derived based on the quasi-Newton family. Simulation results are presented to compare the convergence of the proposed algorithm with least mean square (LMS) algorithm and RLS algorithm. It shows that the proposed new algorithm has comparable convergence speed to the other known adaptive algorithms","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A New Fast Convergence Adaptive Algorithm\",\"authors\":\"P. Palanisamy, N. Kalyanasundaram\",\"doi\":\"10.1109/ICSCN.2007.350719\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a new fast convergence adaptive algorithm with variable step size is proposed for FIR adaptive filter. This new proposed algorithm is derived based on the quasi-Newton family. Simulation results are presented to compare the convergence of the proposed algorithm with least mean square (LMS) algorithm and RLS algorithm. It shows that the proposed new algorithm has comparable convergence speed to the other known adaptive algorithms\",\"PeriodicalId\":257948,\"journal\":{\"name\":\"2007 International Conference on Signal Processing, Communications and Networking\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Signal Processing, Communications and Networking\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSCN.2007.350719\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Signal Processing, Communications and Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSCN.2007.350719","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

针对FIR自适应滤波器，提出了一种新的变步长快速收敛自适应算法。提出了一种基于准牛顿族的算法。仿真结果比较了该算法与最小均方(LMS)算法和RLS算法的收敛性。结果表明，该算法与其他已知的自适应算法具有相当的收敛速度

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A New Fast Convergence Adaptive Algorithm

In this paper, a new fast convergence adaptive algorithm with variable step size is proposed for FIR adaptive filter. This new proposed algorithm is derived based on the quasi-Newton family. Simulation results are presented to compare the convergence of the proposed algorithm with least mean square (LMS) algorithm and RLS algorithm. It shows that the proposed new algorithm has comparable convergence speed to the other known adaptive algorithms

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 International Conference on Signal Processing, Communications and Networking

自引率

0.00%

发文量