By Topic

On synthesis of speed-independent circuits at STG level

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)
Kuan-Jen Lin ; Dept. of Electr. Eng., Chinese Junior Coll. of Technol. & Commerce, Taipei, Taiwan ; Chi-Wen Kuo

Synthesizing hazard-free asynchronous circuits directly at signal transition graph (STG) level has been shown to need significantly less CPU time than approaches at the state-graph. However, all previous methods at STG level were based on sufficient conditions only. Hence, the synthesized circuit results generally are inferior, due to the incomplete transformation. We present a new characteristic graph (CG) to encapsulate all feasible solutions of the original STG in reduced size, which compares favorably with the state graph approach. The requirements of speed independent circuits can then be completely transformed into the CG. Furthermore, we derive a necessary and sufficient condition for speed independent implementation based on a predefined general circuit model, which has not yet been reported. With CGs and this condition, we develop a heuristic synthesis algorithm which derives solutions similar to the state-graph approach while requiring significantly less CPU time

Published in:

Design Automation Conference, 1997. Proceedings of the ASP-DAC '97 Asia and South Pacific

Date of Conference:

28-31 Jan 1997