Implementing the optimal bounding ellipsoid algorithm on a fast processor
- 13 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Set-membership theory applied to linear prediction analysis of speechPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Linear prediction analysis of speech based on set-membership theoryComputer Speech & Language, 1989
- Advantages of a Givens rotation approach to temporally recursive linear prediction analysis of speechIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- A 'systolic array' formulation of the optimal bounding ellipsoid algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- A recursive estimation algorithm using selective updating for spectral analysis and adaptive signal processingIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- Recursive Least-Squares Minimization Using A Systolic ArrayPublished by SPIE-Intl Soc Optical Eng ,1983
- On the value of information in system identification—Bounded noise caseAutomatica, 1982
- Least Squares Computations by Givens Transformations Without Square RootsIMA Journal of Applied Mathematics, 1973