错误编码仿射投影算法

Alejandro Rodriguez, J. Sanchez, J. Avalos
{"title":"错误编码仿射投影算法","authors":"Alejandro Rodriguez, J. Sanchez, J. Avalos","doi":"10.1109/ICMEAE.2015.45","DOIUrl":null,"url":null,"abstract":"This paper presents a modification to the AffineProjection-Like I Algorithm for adaptive filtering withthe purpose of reducing the number of updates and sothe computational load. The modification is achievedby codifying the error and setting a threshold in orderthat the adaptive filter does not need to calculate thealgorithm every iteration. Simulation results showsame convergence speed than the Affine Projection-Like I algorithm, however, number of updates areconsiderably less comparing them to Affine Projection-Like I algorithm.","PeriodicalId":226698,"journal":{"name":"2015 International Conference on Mechatronics, Electronics and Automotive Engineering (ICMEAE)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Error Coded Affine Projection Like Algorithm\",\"authors\":\"Alejandro Rodriguez, J. Sanchez, J. Avalos\",\"doi\":\"10.1109/ICMEAE.2015.45\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a modification to the AffineProjection-Like I Algorithm for adaptive filtering withthe purpose of reducing the number of updates and sothe computational load. The modification is achievedby codifying the error and setting a threshold in orderthat the adaptive filter does not need to calculate thealgorithm every iteration. Simulation results showsame convergence speed than the Affine Projection-Like I algorithm, however, number of updates areconsiderably less comparing them to Affine Projection-Like I algorithm.\",\"PeriodicalId\":226698,\"journal\":{\"name\":\"2015 International Conference on Mechatronics, Electronics and Automotive Engineering (ICMEAE)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Mechatronics, Electronics and Automotive Engineering (ICMEAE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMEAE.2015.45\",\"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 International Conference on Mechatronics, Electronics and Automotive Engineering (ICMEAE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMEAE.2015.45","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文提出了一种改进的类仿射I算法用于自适应滤波,以减少更新次数和计算量。修改是通过对误差进行编码和设置阈值来实现的,这样自适应滤波器就不需要每次迭代都计算算法。仿真结果表明,该算法的收敛速度与仿射投影算法相同,但更新次数明显少于仿射投影算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Error Coded Affine Projection Like Algorithm
This paper presents a modification to the AffineProjection-Like I Algorithm for adaptive filtering withthe purpose of reducing the number of updates and sothe computational load. The modification is achievedby codifying the error and setting a threshold in orderthat the adaptive filter does not need to calculate thealgorithm every iteration. Simulation results showsame convergence speed than the Affine Projection-Like I algorithm, however, number of updates areconsiderably less comparing them to Affine Projection-Like I algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信