Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

Timed Boolean calculus and its applications in timing analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Shiang-Tang Huang ; Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Tai-Ming Parng ; Shyu, J.-M.

Introduces a formalism, called timed Boolean calculus (TBC), and its applications to solving the false path problem in timing analysis. TBC is an extension of conventional Boolean algebra with a delay operator to facilitate modeling the timing behavior of logic circuits. By performing algebraic manipulations on timed Boolean expressions, the actual maximal delays of logic circuits can be obtained. The delay information can then be used by a path reporting algorithm to detect the long false paths, thereby identifying the paths which need be optimized to meet timing constraints. The authors have developed a timing analysis tool based on TBC and tested on ISCAS benchmarks. Experimental results are shown to justify the effectiveness and efficiency of the proposed TBC and algorithms

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:13 ,  Issue: 3 )