By Topic

An algorithm for generation of behavioral shape functions

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)
Holmes, N.D. ; Dept. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA ; Gajski, D.D.

In this paper, we present a new algorithm for analyzing performance/cost tradeoffs in interactive synthesis of DSP algorithms. Our algorithm handles both memories with different access times and pipelined units with different numbers of stages. The output is a shape function illustrating the performance vs. cost tradeoff. We have tested this algorithm on several benchmarks including an FIR filter and a robot kinematics example. Results show that the average difference in cost, as compared to manual designs, is 0.41%, while the average performance difference is 4.90% without memory access times and 0.77% with memory access times

Published in:

European Design and Test Conference, 1994. EDAC, The European Conference on Design Automation. ETC European Test Conference. EUROASIC, The European Event in ASIC Design, Proceedings.

Date of Conference:

28 Feb-3 Mar 1994