{"title":"低成本并行自适应滤波器结构","authors":"Chao Cheng, K. Parhi","doi":"10.1109/ACSSC.2005.1599767","DOIUrl":null,"url":null,"abstract":"In this paper, we present two parallel LMS adaptive filtering algorithms with low hardware. The proposed parallel algorithm 1 doesn't alter the input-output behavior and saves large amount of hardware cost of previous designs, especially when the parallelism level is high. For example, it saves 68.4% of the multiplications and 4.7% of the additions, of those of prior fast parallel adaptive filtering algorithms when parallelism level is 72 and the filter length N is large. The proposed parallel algorithm 2, while maintaining the same performance, can further save 5.56% to 12.5% of the multipliers and 8.54% to 24.9% of the additions when the level of parallelism varies from 3 to 72","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Low Cost Parallel Adaptive Filter Structures\",\"authors\":\"Chao Cheng, K. Parhi\",\"doi\":\"10.1109/ACSSC.2005.1599767\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present two parallel LMS adaptive filtering algorithms with low hardware. The proposed parallel algorithm 1 doesn't alter the input-output behavior and saves large amount of hardware cost of previous designs, especially when the parallelism level is high. For example, it saves 68.4% of the multiplications and 4.7% of the additions, of those of prior fast parallel adaptive filtering algorithms when parallelism level is 72 and the filter length N is large. The proposed parallel algorithm 2, while maintaining the same performance, can further save 5.56% to 12.5% of the multipliers and 8.54% to 24.9% of the additions when the level of parallelism varies from 3 to 72\",\"PeriodicalId\":326489,\"journal\":{\"name\":\"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.2005.1599767\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2005.1599767","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we present two parallel LMS adaptive filtering algorithms with low hardware. The proposed parallel algorithm 1 doesn't alter the input-output behavior and saves large amount of hardware cost of previous designs, especially when the parallelism level is high. For example, it saves 68.4% of the multiplications and 4.7% of the additions, of those of prior fast parallel adaptive filtering algorithms when parallelism level is 72 and the filter length N is large. The proposed parallel algorithm 2, while maintaining the same performance, can further save 5.56% to 12.5% of the multipliers and 8.54% to 24.9% of the additions when the level of parallelism varies from 3 to 72