By Topic

Hilbert space array methods for finite rank process estimation and ladder realizations for adaptive signal processing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Morf, M. ; Stanford University, Stanford, California ; Muravchik, C. ; Lee, D.T.

We present a Hilbert space array approach for deriving fast estimation and adaptive signal processing algorithms, that are recursive in time and order. Ladder (or lattice) forms turn out to be the natural realizations of these algorithms. From a stochastic point of view, the natural class of processes associated with these techniques include stationary but also nonstationary processes of finite (displacement) rank, also referred to as shift-low-rank or alpha-stationary processes. They are encountered in adaptive signal processing, speech modeling and encoding, digital communication, radar and sonar, high-resolution spectral estimation, distance measures etc. The use of projections and orthonormalizations, e.g. via Gram Schmidt procedures, induces real and complex rotations as basic operations, resulting in magnitude normalized variables and numerically stable computations.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '81.  (Volume:6 )

Date of Conference:

Apr 1981