1 / 9

Flip-Flops

מבנה המחשב + מבוא למחשבים ספרתיים תרגול 10#. Flip-Flops. An edge-triggered flip-flop is not a combinational circuit. Claim: An edge-triggered flip-flop is not a combinational circuit. Proof: Every combinational circuit implements a Boolean function.

rchavis
Télécharger la présentation

Flip-Flops

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

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

  2. An edge-triggered flip-flop is not a combinational circuit. Claim: 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 tpd(f) .

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

  4. FF’ Overcoming non-empty intersection of Ci and Ai

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

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

  7. Changing the flip-flop parameters (0) A concatenation of iG gates: • Goal: • (1) Design an edge-triggered flip-flop FF’ with thold(FF) ≤ 0. • (2) Design an edge-triggered flip-flop FF’’ with tsu(FF) ≤ 0.

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

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

More Related