Using timed Boolean algebra to solve false path problem in timing analysis

A new approach to the false path problem is proposed. The approach is based on an extended Boolean algebra and is capable of modeling the logic and timing behavior of logic networks in terms of modified Boolean functions. By applying algebraic manipulations, the approach can extract correct path delays as well as the input vectors for activating the sensitizable paths.<<ETX>>

[1]  Robert K. Brayton,et al.  Timing analysis in precharge/unate networks , 1991, DAC '90.

[2]  Norman P. Jouppi,et al.  Timing Analysis and Performance Improvement of MOS VLSI Designs , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Robert B. Hitchcock,et al.  Timing verification and the timing analysis program , 1988, DAC 1982.

[4]  David Hung-Chang Du,et al.  On the General False Path Problem in Timing Analysis , 1989, 26th ACM/IEEE Design Automation Conference.

[5]  David Hung-Chang Du,et al.  A path selection algorithm for timing analysis , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[6]  James E. Smith,et al.  Developments in Logic Network Path Delay Analysis , 1982, DAC 1982.

[7]  Michiaki Muraoka,et al.  ACTAS: An Accurate Timing Analysis System for VLSI , 1985, DAC 1985.

[8]  Edward Chan.  Development of a Timing Analysis Program for Multiple Clocked Network , 1985, DAC 1985.

[9]  Robert K. Brayton,et al.  Efficient Algorithms for Computing the Longest Viable Path in a Combinational Network , 1989, 26th ACM/IEEE Design Automation Conference.

[10]  Norman P. Jouppi,et al.  Timing Analysis for nMOS VLSI , 1983, 20th Design Automation Conference Proceedings.

[11]  Robert B. Hitchcock,et al.  Timing Analysis of Computer Hardware , 1982, IBM J. Res. Dev..