{"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}
引用次数: 30
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.<>