A delta least squares lattice algorithm for fast sampling

Author

De, Parthapratim ; Fan, H. Howard

Author_Institution

Dept. of Electr. & Comput. Eng., Cincinnati Univ., OH, USA

Volume

3

fYear

1998

fDate

12-15 May 1998

Firstpage

1373

Abstract

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. In this paper, we develop a delta least squares lattice algorithm. This algorithm has low computational complexity compared to the delta Levinson RLS algorithm and shows better numerical properties compared to the shift least squares lattice algorithm. Computer simulations show that the new algorithm also outperforms an existing delta least squares lattice algorithm

Keywords

adaptive filters; adaptive signal processing; computational complexity; filtering theory; lattice filters; least squares approximations; prediction theory; signal sampling; computer simulations; continuous time process; delta least squares lattice algorithm; fast sampling; input discrete time process; low computational complexity; numerical behavior; shift operator-based adaptive algorithms; Adaptive algorithm; Computational complexity; Computer simulation; Lattices; Least squares methods; Matrix decomposition; Mobile communication; Pressing; Resonance light scattering; Sampling methods;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech and Signal Processing, 1998. Proceedings of the 1998 IEEE International Conference on

Conference_Location

Seattle, WA

ISSN

1520-6149

Print_ISBN

0-7803-4428-6

Type

conf

DOI

10.1109/ICASSP.1998.681702

Filename

681702