Abstract
Many subspace updating algorithms based on the eigenvalue decomposition (EVD) of array covariance matrices have been proposed and used in high-resolution array processing algorithms in recent years. In some applications (i.e. ESPRIT algorithms), however, the EVD of an unsymmetrical matrix is also needed. In this paper, an EVD updating approach for an unsymmetrical matrix is presented based on its first-order perturbation analysis. By jointly using this approach and a subspace updating method in an ESPRIT algorithm, a completely adaptive ESPRIT algorithm is obtained. The evaluation of the complexity and the performance of this algorithm is given in the paper.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
