Incremental techniques for the identification of statically sensitizable critical paths

1 January 1991

conference paper
Published by Association for Computing Machinery (ACM)

p. 541-546
https://doi.org/10.1145/127601.127729

Abstract

Thispaper describes new algorithms forjinding the K-most critical paths, checking static sensitizability of these paths, and performing incremental timing verijcation on combinational circuits. The static sensitization method uses binary decision diagraw to avoid costly backtracking operation used in other path analysis programs. The speed and efjciency of the techniques are demonstrated individually using the ISCAS benchmark circuits, and then together in a timhg optimization loop.

Keywords

INCREMENTAL TECHNIQUE
STATICALLY SENSITIZABLE CRITICAL PATH
CIRCUIT ANALYSIS
CRITICAL PATH
COMBINATIONAL CIRCUITS
ALGORITHM DESIGN AND ANALYSIS
PATH ANALYSIS
COMBINATIONAL CIRCUIT
DATA STRUCTURES
BOOLEAN FUNCTIONS
DESIGN OPTIMIZATION

This publication has 0 references indexed in Scilit: