1 Hit in 0.047 sec

Statistical timing verification for transparently latched circuits

Ruiming Chen, Hai Zhou
2006 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
Usually having level-sensitive latches for their speed, high-performance IC designs need to verify the clock schedules. With process variations, the verification needs to compute the probability of correct clocking. Because of complex statistical correlations and accumulated inaccuracy of statistical operations, traditional iterative approaches have difficulty getting accurate results. Instead, a statistical check of the structural conditions for correct clocking is proposed, where the central
more » ... where the central problem is to compute the probability of having a positive cycle in a graph with random edge weights. We propose two algorithms to handle this. The proposed algorithms traverse the graph only several times to reduce the correlations among iterations, and it considers not only data delay variations but also clock skew variations. Although the first algorithm is a heuristic algorithm that may overestimate timing yields, experimental results show that it has an error of 0.16% on average in comparison with the Monte Carlo simulation. Based on a cycle-breaking technique, the second heuristic algorithm can conservatively estimate timing yields. Both algorithms are much more efficient than the Monte Carlo simulation.
doi:10.1109/tcad.2005.857395 fatcat:cqmjpbnqfjb7rornqwachnaoqi