Abstract

A new adaptive filtering algorithm for time-series data based on the QRD inverse updates method of Pan and Plemmons (1989) is derived from first principles. In common with other fast algorithms for time-series adaptive filtering, this algorithm only requires O(p) operations for the solution of a pth-order problem. Unlike previous fast algorithms based on the QRD technique, the algorithm presented here explicitly produces the transversal filter weights. Furthermore the derivation of the algorithm is achieved, quite simply, by means of signal-flow-graph manipulation. The relationship between this fast QRD inverse updates algorithm and the FTF algorithm is briefly discussed. The results of some preliminary computer simulations of the algorithm, using finite-precision floating-point arithmetic, are presented.

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.