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

Practical analysis of cyclic combinational circuits

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

2 Author(s)
Srinivasan, A. ; Mentor Graphics Corp., San Jose, CA, USA ; Malik, S.

Cycles arise in combinational logic circuits under a variety of different circumstances. Typically a cyclic combinational circuit consists of a set of acyclic circuits multiplexed to share resources in a cyclic topology. Recently Malik (1993) provided an algorithm for deciding if a given circuit with cycles is combinational and also an algorithm for static timing analysis of such circuits. The logical analysis technique was based on OBDDs and the timing analysis technique was based on solving the false path problem for a large and complex circuit. As a result that method does not scale well to very large circuits. Prior to the present work, the only option left for designers was to do a case analysis by manually identifying the different acyclic circuits multiplexed in the cyclic structure, and then performing logical and timing analysis on this set of acyclic circuits. In this paper, we provide an analysis technique that automatically identifies the set of acyclic circuits constituting the cyclic circuit. This enables designers to directly use existing logical and timing analysis tools on this set of acyclic circuits. In addition to providing a more intuitive analysis, the proposed algorithm also scales easily to handle the very large circuits encountered in practice, with runtimes of a few hundred seconds on circuits with over 15000 gates

Published in:

Custom Integrated Circuits Conference, 1996., Proceedings of the IEEE 1996

Date of Conference:

5-8 May 1996

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.