This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The First IEEE International Workshop on Electronic Design, Test and Applications (DELTA '02)
A New Transitive Closure Algorithm with Application to Redundancy Identification
Christchurch, New Zealand
January 29-January 31
ISBN: 0-7695-1453-7
Vivek Gaur, Avant! Corp.
Vishwani D. Agrawal, Agere Systems
Michael L. Bushnell, Rutgers University
A new transitive closure algorithm is presented for implication graphs that contain partial implications. In the presence of partial implications, a vertex can assume the true state when all vertices that partially imply it become true. Such graphs provide a more complete representation of a logic circuit than is possible with the conventional pair-wise implications. An application of the new transitive closure algorithm to redundancy identification shows significantly improved results. Empirically, we find the computational complexity of transitive closure to be linear for the implication graphs of the ISCAS benchmark circuits.
Index Terms:
Implication graph, logic redundancy, partial implications, transitive closure
Citation:
Vivek Gaur, Vishwani D. Agrawal, Michael L. Bushnell, "A New Transitive Closure Algorithm with Application to Redundancy Identification," delta, pp.496, The First IEEE International Workshop on Electronic Design, Test and Applications (DELTA '02), 2002
Usage of this product signifies your acceptance of the Terms of Use.