Title :
A delta least squares lattice algorithm for fast sampling
Author :
De, Parthapratim ; Fan, H. Howard
Author_Institution :
Mitsubishi Electr. Corp., New Providence, NJ, USA
fDate :
9/1/1999 12:00:00 AM
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. 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
Keywords :
adaptive signal processing; computational complexity; least squares approximations; mathematical operators; signal sampling; computer simulations; continuous time process; delta Levinson RLS algorithm; delta least squares lattice algorithm; fast sampling; input discrete time process; low computational complexity; numerical properties; shift least squares lattice algorithm; shift operator based least squares lattice algorithm; shift operator-based adaptive algorithms; Adaptive algorithm; Adaptive filters; Computational complexity; Computer simulation; Lattices; Least squares methods; Resonance light scattering; Sampling methods; Signal processing algorithms; Signal sampling;
Journal_Title :
Signal Processing, IEEE Transactions on
