Universal Gates - Aneesa N Ali

1,365 views 24 slides May 29, 2016
Slide 1
Slide 1 of 24
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6
Slide 7
7
Slide 8
8
Slide 9
9
Slide 10
10
Slide 11
11
Slide 12
12
Slide 13
13
Slide 14
14
Slide 15
15
Slide 16
16
Slide 17
17
Slide 18
18
Slide 19
19
Slide 20
20
Slide 21
21
Slide 22
22
Slide 23
23
Slide 24
24

About This Presentation

Universal Gates - Aneesa N Ali


Slide Content

ANEESA N ALI PGT(COMPUTER SCIENCE) KENDRIYA VIDYALAYA MALAPPURAM UNIVERSAL GATES

Objectives What are gates? Fundamental gates. Universal gates - NAND and NOR. How to implement NOT, AND, and OR gates using NAND gates only. How to implement NOT, AND, and OR gates using NOR gates only. Equivalent gates. Two-level digital circuit implementations using universal gates only . Applications 4– 2

What is a gate? Combination of transistors(circuit) that takes one or more inputs and generates an output . So called because one logic state enables or “gates” another logic state. For each gate, the symbol, the truth table, and the formula are shown.

NOT Gate A NOT gate accepts one input value and produces one output value

AND Gate An AND gate accepts two input signals If the two input values for an AND gate are both 1, the output is 1; otherwise, the output is 0

OR Gate If the two input values are both 0, the output value is 0; otherwise, the output is 1

A universal gate is a gate which can implement any Boolean function without using any other gate type. The NAND and NOR gates are universal gates . In practice, this is advantageous since NAND and NOR gates are economical and easier to fabricate and are the basic gates used in all IC digital logic families . In fact, an AND gate is typically implemented as a NAND gate followed by an inverter, not the other way around !!   Likewise, an OR gate is typically implemented as a NOR gate followed by an inverter, not the other way around !!   Universal Gates

NAND and NOR Gates The NAND and NOR gates are essentially the opposite of the AND and OR gates, respectively

Universal Gates How to use NAND gates to build a NOT gate? Truth Table Hint! Link inputs B & C together (to a same source). When A = 0, B = C = When A = 1, B = C = 1 A Q C B A B C Q 1 1 1 1

Universal Gates How to use NAND gates to build an AND gate? Truth Table A Q B A B C Q 1 1 1 1 1 1 1 1 C Hint 1 : Use 2 NAND gates Hint 2 : From a NAND gate, build a NOT gate Hint 3 : Put this “NOT” gate after the NAND gate NAND NOT

Universal Gates How to use NAND gates to build an OR gate? Truth Table A B C D Q 1 1 1 1 1 1 1 1 1 1 1 Hint 1 : Use 3 NAND gates Hint 2 : Use 2 NAND gates to build 2 NOT gates Hint 3 : Put the 3 rd NAND gate after the 2 “NOT” gates A B C D Q

Universal Gates How to use NOR gate to build a NOT gate? Truth Table A B C Q 1 1 1 1 Hint! Link inputs B & C together (to a same source). A Q B C When A = 0, B = C = When A = 1, B = C = 1

Universal Gates How to use NOR gates to build an OR gate? Truth Table Hint 1 : Use 2 NOR gates A Q B C Hint 2 : From a NOR gate, build a NOT gate Hint 3 : Put this “NOT” gate after a NOR gate D E A B C D E Q 1 1 1 1 1 1 1 1 1 1 NOR NOT

Universal Gates How to use NOR gates to build an AND gate? Truth Table Hint 1 : Use 3 NOR gates Hint 2 : From 2 NOR gates, build 2 NOT gates Hint 3 : Each “NOT” gate is an input to the 3 rd NOR gate A B C D Q 1 1 1 1 1 1 1 1 1 A B C D Q

Universal Gates How to use NAND gates to build a NOR gate? Truth Table A B C D E Q 1 1 1 1 1 1 1 1 1 1 1 1 Hint 1 : Use 4 NAND gates Hint 2 : Use 3 NAND gates to build an OR gate Hint 3 : Use a NOR gate to build a NOT gate A B C D Q E Hint 4 : Put the “NOT” gate after “OR” gate

Universal Gates How to use NOR gates to build a NAND gate? Truth Table Hint 2 : Use 3 NOR gates to build a NAND gate Hint 3 : Use the 4 th NOR gate to build a NOT gate Hint 4 : Insert “NOT” gate after “NAND” gate Hint 1 : Use 4 NOR gates A B C D Q E A B C D E Q 1 1 1 1 1 1 1 1 1 1 1 1

Equivalent Gates A NAND gate is equivalent to an inverted-input OR gate. A NOR gate is equivalent to an inverted-input AND gate.

Two-Level Implementations Boolean functions in either SOP or POS forms can be implemented using 2-Level implementations . For SOP forms AND gates will be in the first level and a single OR gate will be in the second level . For POS forms OR gates will be in the first level and a single AND gate will be in the second level . U sing inverters to complement input variables is not counted as a level . SOP forms can be implemented using only NAND gates, while POS forms can be implemented using only NOR gates.

Example 1: Implement the following SOP function  F = XZ + Y’Z + X’YZ

Example 2: Implement the following POS function   F = (X+Z) (Y’+Z) (X’+Y+Z)

Applications: Used in manufacturing logic circuits(devices such as multiplexers , registers , ALUs. Flash memory 4– 22

Questions?? Why are NAND and NOR called universal gates? How many NAND gates make an AND gate? How many NOR gates make an OR gate? An inverted input OR gate is a ……………... Gate. POS forms can be implemented using ………. Gates. 4– 23

THANK YOU
Tags