This preview shows page 1. Sign up to view the full content.
Unformatted text preview: esign Spring 2014, Feb 5 . . .
Spring ELEC 7770: Advanced VLSI Design (Agrawal) 14 Theorem 2 The longest path in a circuit is dynamically
The sensitizable iff it is statically sensitizable.
Proof: Because this is the longest path, all offpath inputs will settle to their sensitizing values
at the inputs of any gate before the on-path
event propagates through that gate.
P. C. McGeer and R. K. Brayton, Integrating
Functional and Temporal Domains in Logic
Design, Springer, 1991, p. 37.
Design Spring 2014, Feb 5 . . .
Spring ELEC 7770: Advanced VLSI Design (Agrawal) 15 Proof of Theorem 2 Case 1: Static sensitization does not specify the
Case value at the path origin.
Toggling the path origin will propagate an event
through the path causing dynamic sensitization.
0 A 01 or 10
here will propagate
through the path
Spring 2014, Feb 5 . . .
Spring Statically sensitized path
ELEC 7770: Advanced VLSI Design (Agrawal) 16 Proof of Theorem 2 (Cont.) Case 2: Static sensitization specifies the value at the path origin. Toggling the path origin will propagate an event through the path
View Full Document
This document was uploaded on 02/23/2014 for the course COMPUTER A 7770 at Auburn University.
- Spring '14