By Topic

Library-adaptively integrated data path synthesis for DSP systems

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

2 Author(s)
J. -M. Jou ; Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan ; S. -R. Kuang

A new algorithm for the integrated data path synthesis of high-performance DSP systems has been proposed. The integrated synthesis problem, that is the combined problem of module selection, scheduling, and allocation, is systematically formulated as a clique-partition problem of mixed-vertex compatibility graph on a module library and is solved simultaneously. We introduce a global cost function based on clique partition heuristic to evaluate each decision along the synthesis process. Salient features, such as library-adaptive and integrated processing (i.e., make all resources, including operators and interconnects, tradeoffs), are processed in the algorithm and experimental results are quite encouraged

Published in:

Computer Design: VLSI in Computers and Processors, 1993. ICCD '93. Proceedings., 1993 IEEE International Conference on

Date of Conference:

3-6 Oct 1993