Download presentation

Presentation is loading. Please wait.

1
**Morgan Kaufmann Publishers**

11 April, 2017 Universal Gates Chapter 4 — The Processor

2
**Outline Universal Gates : NAND and NOR NAND Gate NOR Gate**

Implementation using NAND Gates Implementation using NOR Gates

3
**Outline Universal Gates : NAND and NOR NAND Gate NOR Gate**

Implementation using NAND Gates Implementation using NOR Gates

4
**Universal Gates: NAND and NOR**

AND/OR/NOT gates are sufficient for building any Boolean functions. We call the set {AND, OR, NOT} a complete set of logic. However, other gates are also used because: (i) usefulness (ii) economical on transistors (iii) self-sufficient NAND/NOR: economical, self-sufficient XOR: useful (e.g. parity bit generation)

5
**(x.x)' = x' (T1: idempotency)**

NAND Gate (1/2) NAND gate is self-sufficient (can build any logic circuit with it). Therefore, {NAND} is also a complete set of logic. Can be used to implement AND/OR/NOT. Implementing an inverter using NAND gate: x x' (x.x)' = x' (T1: idempotency)

6
**NAND Gate (2/2) Implementing AND using NAND gates:**

x x.y y (x.y)' ((x.y)'(x.y)')' = ((x.y)')' idempotency = (xy) involution Implementing OR using NAND gates: x x+y y x' y' ((x.x)'(y.y)')' = (x'.y')' idempotency = x''+y'' DeMorgan = x+y involution

7
**(x+x)' = x' (T1: idempotency)**

NOR Gate (1/2) NOR gate is also self-sufficient. Therefore, {NOR} is also a complete set of logic Can be used to implement AND/OR/NOT. Implementing an inverter using NOR gate: x x' (x+x)' = x' (T1: idempotency)

8
**NOR Gate (2/2) Implementing AND using NOR gates:**

x x.y y x' y' ((x+x)'+(y+y)')'=(x'+y')' idempotency = x''.y'' DeMorgan = x.y involution Implementing OR using NOR gates: x x+y y (x+y)' ((x+y)'+(x+y)')' = ((x+y)')' idempotency = (x+y) involution

9
**Outline Universal Gates : NAND and NOR NAND Gate NOR Gate**

Implementation using NAND Gates Implementation using NOR Gates

10
**Implementation using NAND gates (1/2)**

Possible to implement any Boolean expression using NAND gates. Procedure: (i) Obtain sum-of-products Boolean expression: Example: F3 = x.y'+x'.z (ii) Use DeMorgan theorem to obtain expression using 2-level NAND gates = (x.y'+x'.z)' ' involution = ((x.y')' . (x'.z)')' DeMorgan

11
**Implementation using NAND gates (2/2)**

x' z F3 (x'.z)' (x.y')' x y' F3 = ((x.y')'.(x'.z)') ' = x.y' + x'.z

12
**Outline Universal Gates : NAND and NOR NAND Gate NOR Gate**

Implementation using NAND Gates Implementation using NOR Gates

13
**Implementation using NOR gates (1/2)**

Possible to implement any Boolean expression using NOR gates. Procedure: (i) Obtain product-of-sums Boolean expression: Example: F6 = (x+y').(x'+z) (ii) Use DeMorgan theorem to obtain expression using 2-level NOR gates. = ((x+y').(x'+z))' ' involution = ((x+y')'+(x'+z)')' DeMorgan

14
**Implementation using NOR gates (2/2)**

x' z F6 (x'+z)' (x+y')' x y' F6 = ((x+y')'+(x'+z)')' = (x+y').(x'+z)

Similar presentations

OK

Transistors and Logic Circuits. Transistor control voltage in voltage out control high allows current to flow -- switch is closed (on) control low stops.

Transistors and Logic Circuits. Transistor control voltage in voltage out control high allows current to flow -- switch is closed (on) control low stops.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on democracy and equality in indian Ppt on bugatti veyron engine Ppt on cloud computing Ppt on astronomy and astrophysics courses How to present a seminar ppt on 4g Ppt on environmental pollution and control Ppt on launching a new product in india View my ppt online maker Ppt on asian continental divide Ppt on ms word features