Abstract

Eigenstructure decomposition of correlation matrices is an important pre-processing stage in many modern signal processing applications. In an unknown and possibly changing environment, adaptive algorithms that are efficient and numerically stable as well as readily implementable in hardware for eigendecomposition are highly desirable. Most modern real-time signal processing applications involve processing large amounts of input data and require high throughput rates in order to fulfil the needs of tracking and updating. The authors consider the use of a novel systolic array architecture for the high throughput online implementation of the adaptive simultaneous iteration method (SIM) algorithm for the estimation of the p largest eigenvalues and associated eigenvectors of quasi-stationary or slowly varying correlation matrices. >

Full Text
Paper version not known

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 call

Disclaimer: 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.