Andere Kunden interessierten sich auch für
![Linear Systems Identification]( "Linear Systems Identification")
Linear Systems Identification29,99 €![Strategies for Feedback Linearisation]( "Strategies for Feedback Linearisation")
Strategies for Feedback Linearisation74,99 €![Neural Networks for Identification, Prediction and Control]( "Neural Networks for Identification, Prediction and Control")
Neural Networks for Identification, Prediction and Control37,99 €![Usage of QR-Codes For Urban Taxi in Yaounde]( "Usage of QR-Codes For Urban Taxi in Yaounde")
Usage of QR-Codes For Urban Taxi in Yaounde26,99 €![Automatic Authentication of Student Identity Cards Using QR Code]( "Automatic Authentication of Student Identity Cards Using QR Code")
Automatic Authentication of Student Identity Cards Using QR Code26,99 €![Handbook of Control Systems Engineering]( "Handbook of Control Systems Engineering")
Handbook of Control Systems Engineering221,99 €![Vision-Based Adult Image Content Identification]( "Vision-Based Adult Image Content Identification")
Vision-Based Adult Image Content Identification36,99 €
The Extended QR-RLS algorithm is a computationally efficient square-root adaptive filtering algorithm for recursive least-squares (RLS) estimation. It is based upon QR decomposition. The motivation for using the QR decomposition in adaptive filtering is to exploit its good numerical properties. This method solves directly for the time-recursive least squares filter vector, while avoiding the highly serial back substitution Step required in direct QR approaches. This algorithm bears one to one correspondence that exists between the Kalman variables and the RLS variables.Furthermore, this method is based on Givens rotations that lend itself to a parallel implementation in the form of a systolic array. This method offers superior numerical properties. It is computationally efficient and highly concurrent. Parallel implementation of the resulting method in the form of systolic array and its application to system identification is briefly discussed.