New fast inverse QR least squares adaptive algorithms
Lists
Only you see this
Abstract
The paper presents two new, closely related adaptive algorithms for LS system identification. The starting point for the derivation of the algorithms is the inverse Cholesky factor of the data correlation matrix, obtained via a QR decomposition (QRD). Both are of O(p) computational complexity with p being the order of the system. The first algorithm is a fixed order QRD scheme with enhanced parallelism. The second is a lattice type algorithm based on Givens rotations, with lower complexity compared to previously derived ones.
BibTeX
@inproceedings{rontogiannis1995new,
author = {Athanasios A. Rontogiannis and Sergios Theodoridis},
title = {{New fast inverse QR least squares adaptive algorithms}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {1995},
url = {https://openreview.net/forum?id=xsAgjtHRxk},
}Loading related content...