Leonardo C. Resende, D. B. Haddad, M. R. Petraglia
{"title":"一种自适应系数矢量复用的变步长NLMS算法","authors":"Leonardo C. Resende, D. B. Haddad, M. R. Petraglia","doi":"10.1109/EIT.2018.8500096","DOIUrl":null,"url":null,"abstract":"In adaptive filtering, there is usually a trade-off between the speed of convergence and the accuracy of the learning procedure. Recently, variable step-size algorithms and coefficient vector reusing schemes were proposed to solve this trade-off. This paper presents a new adaptive filtering algorithm that combines both strategies to achieve fast convergence speed and low steady-state misadjustment simultaneously. In the proposed algorithm, the error signal is used to dynamically adjust the step-size and the reusing order in each iteration. Simulation results demonstrate better performance of the proposed algorithm when compared to previously proposed approaches.","PeriodicalId":188414,"journal":{"name":"2018 IEEE International Conference on Electro/Information Technology (EIT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"A Variable Step-Size NLMS Algorithm with Adaptive Coefficient Vector Reusing\",\"authors\":\"Leonardo C. Resende, D. B. Haddad, M. R. Petraglia\",\"doi\":\"10.1109/EIT.2018.8500096\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In adaptive filtering, there is usually a trade-off between the speed of convergence and the accuracy of the learning procedure. Recently, variable step-size algorithms and coefficient vector reusing schemes were proposed to solve this trade-off. This paper presents a new adaptive filtering algorithm that combines both strategies to achieve fast convergence speed and low steady-state misadjustment simultaneously. In the proposed algorithm, the error signal is used to dynamically adjust the step-size and the reusing order in each iteration. Simulation results demonstrate better performance of the proposed algorithm when compared to previously proposed approaches.\",\"PeriodicalId\":188414,\"journal\":{\"name\":\"2018 IEEE International Conference on Electro/Information Technology (EIT)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-05-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference on Electro/Information Technology (EIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EIT.2018.8500096\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Electro/Information Technology (EIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EIT.2018.8500096","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Variable Step-Size NLMS Algorithm with Adaptive Coefficient Vector Reusing
In adaptive filtering, there is usually a trade-off between the speed of convergence and the accuracy of the learning procedure. Recently, variable step-size algorithms and coefficient vector reusing schemes were proposed to solve this trade-off. This paper presents a new adaptive filtering algorithm that combines both strategies to achieve fast convergence speed and low steady-state misadjustment simultaneously. In the proposed algorithm, the error signal is used to dynamically adjust the step-size and the reusing order in each iteration. Simulation results demonstrate better performance of the proposed algorithm when compared to previously proposed approaches.