{"title":"Adaptive signal-subspace processing based on first-order perturbation analysis","authors":"B. Champagne","doi":"10.1109/PACRIM.1991.160696","DOIUrl":null,"url":null,"abstract":"An approach to adaptive signal-subspace processing of narrowband array data is presented. It is based on the application of first-order perturbation analysis. In the proposed approach, the correction term in the recursive estimate of the array covariance matrix at time k is viewed as a perturbation of the estimate at time k-1. Following this interpretation, the theory of perturbation of Hermitian matrices is applied in order to obtain a new recursion expressing the eigenstructure estimate of R/sub x/(k), the true array covariance matrix at time k, in terms of the eigenstructure estimate of R/sub x/(k-1). This algorithm can be realized by means of L linear combiners with nonlinear weight-vector adaptation equations, where L is the signal-subspace dimensionality. These nonlinear adaptation equations appear to be substitutes for the orthonormal weight constraints found in other algorithms. The results of preliminary simulations are discussed.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"432 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.1991.160696","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
An approach to adaptive signal-subspace processing of narrowband array data is presented. It is based on the application of first-order perturbation analysis. In the proposed approach, the correction term in the recursive estimate of the array covariance matrix at time k is viewed as a perturbation of the estimate at time k-1. Following this interpretation, the theory of perturbation of Hermitian matrices is applied in order to obtain a new recursion expressing the eigenstructure estimate of R/sub x/(k), the true array covariance matrix at time k, in terms of the eigenstructure estimate of R/sub x/(k-1). This algorithm can be realized by means of L linear combiners with nonlinear weight-vector adaptation equations, where L is the signal-subspace dimensionality. These nonlinear adaptation equations appear to be substitutes for the orthonormal weight constraints found in other algorithms. The results of preliminary simulations are discussed.<>