Tutorial Chapter 3 Gate_level Minimization Part 2

23
TUTORIAL CHAPTER 3 GATE_LEVEL MINIMIZATION PART 2 TA. Arwa Al Saad. 9 November 2013

description

Tutorial Chapter 3 Gate_level Minimization Part 2. TA. Arwa Al Saad . 9 November 2013. NAND and NOR Implementation. - Digital circuits are frequently constructed with NAND or NOR gates rather than with AND and OR gates. NAND Circuits. - PowerPoint PPT Presentation

Transcript of Tutorial Chapter 3 Gate_level Minimization Part 2

Page 1: Tutorial Chapter 3 Gate_level Minimization Part 2

TUTORIAL CHAPTER 3GATE_LEVEL MINIMIZATIONPART 2

TA. Arwa Al Saad. 9 November 2013

Page 2: Tutorial Chapter 3 Gate_level Minimization Part 2

NAND and NOR Implementation

- Digital circuits are frequently constructed with NAND or NOR gates rather than with AND and OR gates.

Page 3: Tutorial Chapter 3 Gate_level Minimization Part 2

NAND Circuits NAND gate: a universal gate

– Any digital system can be implemented with it• including AND, OR and complement

Page 4: Tutorial Chapter 3 Gate_level Minimization Part 2

Steps of Implementation two levels NAND gates

1. Express simplified function in sum of products.

2. Change every AND in first level to AND-invert.3. Change OR in second level to AND-invert or

invert-OR4. Invert any single literal in the first level.

Page 5: Tutorial Chapter 3 Gate_level Minimization Part 2

Two-Level Implementation with NAND

sum of product expression and its equivalent

NAND implementation

F = AB + CD([ =AB(*’)CD’]’)

Page 6: Tutorial Chapter 3 Gate_level Minimization Part 2

Question#1 Draw a NAND diagram that implements

the following function: F(A,B,C)=∑(5,6,7):

F= AC+AB

Page 7: Tutorial Chapter 3 Gate_level Minimization Part 2

Diagram with AND,OR:

Diagram with AND-invert and invert-OR: Diagram with two AND-invert:

Question#1

F=((AC)’(AB)’)’F= AC+AB

Page 8: Tutorial Chapter 3 Gate_level Minimization Part 2

Steps of implementing Multilevel NAND Circuits1. Convert all AND gates to NAND gates with AND-

invert graphic symbols.2. Convert all OR gates to NAND gates with only invert-

OR graphic symbols.3. Check all the bubbles in the diagrams. For a single

bubble, invert an inverter (one-input NAND gate) or complement the input literal.

Page 9: Tutorial Chapter 3 Gate_level Minimization Part 2
Page 10: Tutorial Chapter 3 Gate_level Minimization Part 2

NOR Circuite The NOR gate is anothar universal gate to

implement any Boolean Function.

Page 11: Tutorial Chapter 3 Gate_level Minimization Part 2

Steps of Implementation two levels NOR gates

1. Express simplified function in product of sum.2. Change every OR in first level to OR-invert.3. Change AND in second level to OR-invert or

invert-AND.4. Invert any single literal in the first level.

Page 12: Tutorial Chapter 3 Gate_level Minimization Part 2

Questions #2 Draw a NOR diagram that implements

the following function: F= (A+B)(C+D)E

Page 13: Tutorial Chapter 3 Gate_level Minimization Part 2

Questions #2Diagram with OR-invert and invert-AND:

Page 14: Tutorial Chapter 3 Gate_level Minimization Part 2

Steps of implementing Multilevel NOR Circuits

1. Convert all OR gates to NOR gates with OR-invert graphic symbols.

2. Convert all AND gates to NOR gates with only invert-AND graphic symbols.

3. Check all the bubbles in the diagrams. For a single bubble, invert an inverter (one-input NOR gate) or complement the input literal.

Page 15: Tutorial Chapter 3 Gate_level Minimization Part 2

Draw logic diagram with NOR gate for the following function:

F=(AB’ + A’B) (C+D’)

Page 16: Tutorial Chapter 3 Gate_level Minimization Part 2

Evolution 4 Draw a NAND logic diagram that

implements the following function: F(A,B,C,D)=∑(0,4,8,9,10,11,12,14)

Page 17: Tutorial Chapter 3 Gate_level Minimization Part 2
Page 18: Tutorial Chapter 3 Gate_level Minimization Part 2

Q3.28

Derive the circuits for a three-bit parity generator and four-bit checker using an odd parity bit

0 means a correct transmission.

Page 19: Tutorial Chapter 3 Gate_level Minimization Part 2

Three-bit parity generator (odd) F=(X Y Z)’

Page 20: Tutorial Chapter 3 Gate_level Minimization Part 2
Page 21: Tutorial Chapter 3 Gate_level Minimization Part 2

Four-bit parity checker(odd) F=(X Y Z)’

Page 22: Tutorial Chapter 3 Gate_level Minimization Part 2
Page 23: Tutorial Chapter 3 Gate_level Minimization Part 2

DONE