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....

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing Vol. 47; no. 9; pp. 2396 - 2406
Main Authors: De, P., Fan, H.H.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.09.1999
Institute of Electrical and Electronics Engineers
Subjects:
ISSN:1053-587X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1053-587X
DOI:10.1109/78.782183