A New Transitive Closure Algorithm with Application to Redundancy Identification

Authors:
Vivek Gaur;Vishwani D. Agrawal;Michael L. Bushnell
Affiliations:
-;-;-
Venue:
DELTA '02 Proceedings of the The First IEEE International Workshop on Electronic Design, Test and Applications (DELTA '02)
Year:
2002

Citing 0
Cited 1

A Fault-Independent Transitive Closure Algorithm for Redundancy Identification

VLSID '03 Proceedings of the 16th International Conference on VLSI Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.