Statistical timing verification for transparently latched circuits through structural graph traversal

Xingliang Yuan, Jia Wang

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

4 Citations (Scopus)

Abstract

Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will adapt random delays at runtime due to time borrowing. The central problem to determine the timing yield is to compute the probability of the presence of a positive cycle in the latest latch timing graph. Existing algorithms are either optimistic since cycles are omitted or require iterations that cannot be polynomially bounded. In this paper, we present the first algorithm to compute such probability based on block-based statistical timing analysis that, first, covers all cycles through a structural graph traversal, and second, terminates within a polynomial number of statistical "sum" and "max" operations. Experimental results confirm that the proposed approach is effective and efficient.

Original languageEnglish
Title of host publication2010 15th Asia and South Pacific Design Automation Conference, ASP-DAC 2010
Pages663-668
Number of pages6
DOIs
Publication statusPublished - 28 Apr 2010
Externally publishedYes
Event2010 15th Asia and South Pacific Design Automation Conference, ASP-DAC 2010 - Taipei, Taiwan
Duration: 18 Jan 201021 Jan 2010

Conference

Conference2010 15th Asia and South Pacific Design Automation Conference, ASP-DAC 2010
CountryTaiwan
CityTaipei
Period18/01/1021/01/10

Cite this