By Topic

An integrated data path synthesis algorithm based on network flow method

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)
Taewhan Kim ; Lattice Semicond. Corp., Milpitas, CA, USA ; C. L. Liu

We present an integrated approach to the solution of the scheduling, allocation (register and interconnections), and binding problems in high-level synthesis. Our algorithm synthesizes a data path from an unscheduled-data flow graph with an objective of minimizing both the number of control steps and total design area. Unlike most of the prior approaches in which interconnections are determined only in the final step of the synthesis process in our approach, scheduling of operations binding of operations to functional units, and binding of variables to registers are performed simultaneously so that interconnections are determined optimally for each control step. The problem is formulated as a minimum cost maximum flow problem in a network which can be solved in polynomial time using the minimum cost augmentation method. Experimental results on a number of benchmark problems show that the approach is quite effective

Published in:

Custom Integrated Circuits Conference, 1995., Proceedings of the IEEE 1995

Date of Conference:

1-4 May 1995