By Topic

Look-ahead computation: Improving iteration bound in linear recursions

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

2 Author(s)
Parhi, K. ; University of California, Berkeley, CA ; Messerschmitt, D.G.

The maximum achievable sampling rate of recursive algorithms is inherently bounded due to the computational latency associated with the loop computation. This recursion or feedback in the algorithms destroys the opportunity to pipeline any recursive loop. In this paper, we introduce a technique of look-ahead computation applicable to any linear recursive algorithm (LRA) to achieve equivalent realizations with reduced iteration period and higher sampling rate. The concurrency created by the use of look-ahead computation can be used to obtain pipelined and/or block implementations. We illustrate the applicability of the look-ahead computation technique to obtain high speed VLSI realizations of linear time-invariant, and time-varying systems. A generalized look-ahead computation technique theorem for arbitrary interleaving is also presented. Finally, it is shown that the iteration period in certain synchronous data flow graphs can also be reduced by the use of look-ahead computation.

Published in:

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

Date of Conference:

Apr 1987