By Topic

An extension of the fast algorithm for linear phase system identification

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

1 Author(s)
Marple, S.L., Jr. ; Schlumberger Well Services, Houston, Texas

A fast (computationally efficient) least squares algorithm to fit a Mth order linear phase (symmetric) FIR system to an input/output sequence was presented in reference [1]. This algorithm solved the normal equations associated with the least squares procedure with a number of computations proportional to M2, rather than M3as required for general purpose linear equation algorithms. The linear phase system identification problem occurs in certain signal processing applications where no phase distortion is a requirement. The fast algorithm is possible due to the near-to-Toeplitz plus-Hankel-property of the normal equation matrix. The algorithm reported in [1] required 2NM + 24M2operations, where N is the number of data samples. This paper describes some additional properties that further reduces this complexity to 2NM + 18M2. This results in a computational savings of 15% to 20% for typical values of N and M.

Published in:

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

Date of Conference:

Apr 1985