By Topic

The most efficient implementation of the IQML algorithm

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
$33 $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)
Yingbo Hua ; Dept. of Electr. & Electron. Eng., Melbourne Univ., Parkville, Vic., Australia

The work by Clark and Scharf (1992) showed a new implementation of the IQML (iterative quadratic maximum likelihood) algorithm, which requires at each iteration computational flops of order N2 where N is the dimension of signal vector (or length of data sequence). They also indicated that the implementation of other related algorithms such as the Steiglitz-McBride (1965) algorithm would also require order N2 computations. The present author gives a better way of implementation which requires computational flops of the order N. This better way of implementation is shown in detail for the IQML algorithm. Following the same idea shown in the present paper, one can also straightforwardly design the order N implementation of the Steiglitz-McBride algorithm. The present implementation is also the most efficient in that no implementation can be made less than order N2

Published in:

IEEE Transactions on Signal Processing  (Volume:42 ,  Issue: 8 )