{"title":"改进自适应滤波器的初始收敛性:变长LMS算法","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":"{\"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}","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}
Improving the initial convergence of adaptive filters: variable-length LMS algorithms
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.