Transient state nodes and a method for their identification

Data processing: software development – installation – and managem – Software program development tool – Testing or debugging

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C717S132000, C717S133000, C703S014000, C703S015000, C703S016000

Reexamination Certificate

active

07412695

ABSTRACT:
Sequential digital integrated circuits have stable state nodes that are capable of retaining their state (logic value) even in the absence of any input directly driving these points. However, in addition to stable state nodes, some custom-designed digital circuits have so-called transient state nodes. A transient state node is defined as node that can directly affect the value of a stable state node and is combinatorially driven by inputs of the circuit, but the transition delay from at least one input to the node is greater than a predefined threshold value. Identifying such transient state nodes, along with the stable state nodes, is critical for the efficient simulation of custom digital circuits by a hierarchical device level digital simulator. A method is provided herein for identifying transient state nodes in a digital circuit, given the circuit's netlist and the identity of the stable state nodes in the circuit.

REFERENCES:
patent: 5640328 (1997-06-01), Lam
patent: 6138266 (2000-10-01), Ganesan et al.
patent: 6249898 (2001-06-01), Koh et al.
patent: 6499129 (2002-12-01), Srinivasan et al.
patent: 7246334 (2007-07-01), Dastidar et al.
patent: 2004/0044510 (2004-03-01), Zolotov et al.
Ng et. al., ‘Generation of Layouts from MOS Circuit Schematics: A Graph Theoretic Approach’, 22ndDesign Automation Conference, pp. 39-45, 1985, IEEE.
Shakhievich et. al., ‘Adaptive Scheduling Algorithm Based on Mixed Graph Model’, IEE Proc.—Control Theory Appl., vol. 143, No. 1, Jan. 1996.
Jones et. al., ‘Hierachical VLSI Design Systems based on Attribute Grammars’, pp. 58-69, 1986, ACM.
Chandy et. al., ‘Distributed Computation on Graphs: Shortest Path Algorithms’, pp. 833-837, 1982, ACM.
Beerel et. al., ‘Testability of Asynchronous Timed Control Circuits with Delay Assumptions’,.28thACM/IEEE Design Automation Conference, pp. 446-451, 1991, ACM.
Dan Adler, ‘Switch-Level Simulation Using Dynamic Graph Algorithms’, Mar. 1991, IEEE Transactions on Computer-Aided Design, vol. 10. No. 3.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Transient state nodes and a method for their identification does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Transient state nodes and a method for their identification, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transient state nodes and a method for their identification will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4009216

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.