Cart (Loading....) | Create Account
Close category search window

A synthesis algorithm for pipelined data paths with conditional module sharing

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

4 Author(s)
Wakabayashi, S. ; Hiroshima Univ., Japan ; Ohashi, N. ; Miyao, J. ; Yoshida, N.

The problem of pipelined data path synthesis in VLSI design is investigated. Given the behavioral description of the circuit to be synthesized, in which one or more conditional branches may be nested, the authors propose a heuristic algorithm, which takes the mutual exclusiveness of conditional branches into account so that more than one operation shares a hardware module, and hence a chip with small size will be produced. Experimental results show that the proposed heuristic algorithm efficiently produces a nearly optimum solution. The authors present a conditional resource sharing algorithm which simultaneously determines resource sharing and pipeline scheduling. The algorithm is based on a module sharing graph, in which each vertex corresponds to a pair of operators that may share a hardware module. With the module sharing graph, the conditional resource sharing problem is reduced to the problem of finding a set of paths on the module sharing graph. The proposed algorithm does not need user interaction, and hence no careful adjustment of parameter values is needed. Experimental results show that the proposed heuristic algorithm efficiently produces a nearly optimum solution

Published in:

Circuits and Systems, 1992. ISCAS '92. Proceedings., 1992 IEEE International Symposium on  (Volume:2 )

Date of Conference:

10-13 May 1992

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.