Bootstrap:一种快速盲自适应信号分离器

A. Dinc, Yeheskel Bar-Ness
{"title":"Bootstrap:一种快速盲自适应信号分离器","authors":"A. Dinc, Yeheskel Bar-Ness","doi":"10.1109/ICASSP.1992.226054","DOIUrl":null,"url":null,"abstract":"A fast multidimensional adaptive algorithm, Bootstrap, is proposed for multiple signal separation. It separates multiple uncorrelated signals imposed on each other. The bootstrap adaptive algorithm, which does not require training sequences, uses an optimization criteria that is based on minimization of output signal correlations. The learning process of this algorithm is compared with that of the least mean square (LMS) algorithm for different eigenvalue spreads. It has been found from computer simulations that the Bootstrap algorithm converges much faster than the LMS algorithm. The learning process of the Bootstrap algorithm is almost independent of eigenvalue spread.<<ETX>>","PeriodicalId":163713,"journal":{"name":"[Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":"{\"title\":\"Bootstrap: a fast blind adaptive signal separator\",\"authors\":\"A. Dinc, Yeheskel Bar-Ness\",\"doi\":\"10.1109/ICASSP.1992.226054\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A fast multidimensional adaptive algorithm, Bootstrap, is proposed for multiple signal separation. It separates multiple uncorrelated signals imposed on each other. The bootstrap adaptive algorithm, which does not require training sequences, uses an optimization criteria that is based on minimization of output signal correlations. The learning process of this algorithm is compared with that of the least mean square (LMS) algorithm for different eigenvalue spreads. It has been found from computer simulations that the Bootstrap algorithm converges much faster than the LMS algorithm. The learning process of the Bootstrap algorithm is almost independent of eigenvalue spread.<<ETX>>\",\"PeriodicalId\":163713,\"journal\":{\"name\":\"[Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-03-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"30\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASSP.1992.226054\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.1992.226054","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 30

摘要

提出了一种用于多信号分离的快速多维自适应算法Bootstrap。它分离了多个相互强加的不相关信号。自适应算法不需要训练序列,它使用基于输出信号相关性最小化的优化准则。在不同的特征值扩展情况下,将该算法与最小均方(LMS)算法的学习过程进行了比较。计算机仿真结果表明,Bootstrap算法的收敛速度比LMS算法快得多。Bootstrap算法的学习过程几乎不受特征值扩展的影响
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Bootstrap: a fast blind adaptive signal separator
A fast multidimensional adaptive algorithm, Bootstrap, is proposed for multiple signal separation. It separates multiple uncorrelated signals imposed on each other. The bootstrap adaptive algorithm, which does not require training sequences, uses an optimization criteria that is based on minimization of output signal correlations. The learning process of this algorithm is compared with that of the least mean square (LMS) algorithm for different eigenvalue spreads. It has been found from computer simulations that the Bootstrap algorithm converges much faster than the LMS algorithm. The learning process of the Bootstrap algorithm is almost independent of eigenvalue spread.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信