By Topic

A heuristic approach to datapath scheduling of complex conditional structure

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

3 Author(s)
Nakamura, S. ; Dept. of Inf. Syst. Eng., Osaka Univ., Japan ; Yamada, A. ; Shirakawa, I.

This paper proposes a new heuristic approach to the time-constrained datapath scheduling with complex conditional structures. This algorithm intends to select the best of all solutions attained by the iterative refinement process. Experimental results demonstrate that this algorithm attains optimal results in most cases and can be applied to a practical scale of datapath scheduling

Published in:

Microelectronics and VLSI, 1995. TENCON '95., IEEE Region 10 International Conference on

Date of Conference:

6-10 Nov 1995