By Topic

Efficient realization structure of the a priori lattice-ladder recursive least squares 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
$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)
Petropulu, A.P. ; Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA ; Nikias, C.L. ; Proakis, J.G.

An efficient pipelined realization structure of the a priori lattice-ladder least squares multichannel algorithm is introduced. The structure is shown to exhibit great modularity and high parallelism. The architecture is evaluated for cost and data throughput delay assuming pipelined operations. It is demonstrated that the throughput rate of the structure is O(1) and the cost is O(l2 N), where l is the number of channels and N is the order of the filter

Published in:

Signal Processing, IEEE Transactions on  (Volume:39 ,  Issue: 4 )