By Topic

Automatic synthesis of speed-independent circuits from signal transition graph specifications

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)
Sung-Bum Park ; Dept. of Comput. Sci., Tokyo Inst. of Technol., Japan ; T. Nanya

We propose a verification method of the complete state coding property for signal transition graph specifications with single cycle signals. We also propose an optimized logic synthesis method for generating speed-independent circuits without the state graph representation. We use a circuit model for each non-input signal, which consists of a C-element and AND-gates. The resulting circuit is optimized by extracting the literals. We introduce semi-lock, full-lock, and associate-lock relations to generate circuits even though the lock graph by the full-lock relation is disconnected, Our method has polynomial complexity. We compare experimentally our method with other methods, and get better or equal results

Published in:

VLSI Design, 1996. Proceedings., Ninth International Conference on

Date of Conference:

3-6 Jan 1996