A delta least squares lattice algorithm for fast sampling

Most shift operator-based adaptive algorithms exhibit poor numerical behavior when the input discrete time process is obtained from a continuous time process by fast sampling. This includes the shift operator based least squares lattice algorithm. We develop a delta least squares lattice algorithm....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on signal processing Jg. 47; H. 9; S. 2396 - 2406
Hauptverfasser: De, P., Fan, H.H.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.09.1999
Institute of Electrical and Electronics Engineers
Schlagworte:
Adaptive algorithm
Adaptive algorithms
Adaptive filters
Algorithms
Applied sciences
Computational complexity
Computer simulation
Deltas
Exact sciences and technology
Information, signal and communications theory
Lattices
Least squares method
Least squares methods
Operators
Resonance light scattering
Sampling
Sampling methods
Sampling, quantization
Signal and communications theory
Signal processing algorithms
Signal sampling
Telecommunications and information theory
Sampled system
Numerical analysis
Adaptive algorithm
Computer simulation
Least squares method
Delta operator
Signal processing
Lattice filter
Computational complexity
Implementation
ISSN:1053-587X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Most shift operator-based adaptive algorithms exhibit poor numerical behavior when the input discrete time process is obtained from a continuous time process by fast sampling. This includes the shift operator based least squares lattice algorithm. We develop a delta least squares lattice algorithm. This algorithm has a low computational complexity compared with the delta Levinson RLS algorithm and shows better numerical properties compared with the shift least squares lattice algorithm under fast sampling. Computer simulations show that the new algorithm also outperforms an existing delta least squares lattice algorithm.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1053-587X
DOI:10.1109/78.782183