By Topic

Solving the scheduling problem in high level synthesis using a normalized mean field neural network

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

3 Author(s)
M. K. Unaltuna ; Dept. of Electr. & Comput. Eng., Syracuse Univ., NY, USA ; M. E. Dalkilic ; V. Pitchumani

A neural network solution to the time constrained scheduling problem in high level synthesis of digital circuits is proposed. The mean field theory neural network with graded neurons, proposed by Peterson and Soderberg (1989) is adapted and renamed as normalized mean field net. With the use of ASAP and ALAP schedules as limiting constraints, the number of neural variables is kept to a scalable size resulting in a fast and efficient implementation. An extension to include multi-cycle operations is presented. The proposed network is simulated and tested on two examples including a fairly large benchmark circuit from the 1988 High Level Synthesis Workshop. In all cases, the network is able to find optimal solutions in the first trial

Published in:

Neural Networks, 1993., IEEE International Conference on

Date of Conference: