1. Flip-Flops מבנה המחשב + מבוא למחשבים ספרתיים תרגול 10#

2. An edge-triggered flip-flop is not a combinational circuit. Proof: Every combinational circuit implements a Boolean function. We show that an edge-triggered flip-flop is not an implementation of any Boolean function. Assume the an edge-triggered flip-flop FF implements a Boolean function f with propagation delay t pd (f ). Claim: An edge-triggered flip-flop is not a combinational circuit.

3. For CLK = 0 and D = 0, f(0,0) = Q = 1. For CLK = 0 and D = 0, f(0,0) = Q = 0. 1 0 ⇒ FF doesn’t implement any Boolean function. ⇒ FF is not a combinational circuit.

4. FF’ Overcoming non-empty intersection of C i and A i

5. CONT(MUX) PD(MUX) Clock enabled edge-triggered flip-flop

6. Definition: An edge-triggered flip-flop with a reset signal is defined as follows: An edge-triggered flip-flop with a reset signal

7. Changing the flip-flop parameters (0) A concatenation of i G gates: Goal: (1) Design an edge-triggered flip-flop FF’ with t hold (FF) ≤ 0. (2) Design an edge-triggered flip-flop FF’’ with t su (FF) ≤ 0.

8. FF’ Changing the flip-flop parameters (1)

9. Changing the flip-flop parameters (2) CONT(G i ) PD(G i ) CONT(G i ) PD(G i ) FF’’ X