Chapter 4

31
Chapter 4 Chapter 4 Logic Gates and Boolean Algebra

description

Chapter 4. Logic Gates and Boolean Algebra. Introduction. Logic gates are the actual physical implementations of the logical operators . These gates form the basic building blocks for all digital logic circuits . Logic gates process signals which represent true or false. - PowerPoint PPT Presentation

Transcript of Chapter 4

Page 1: Chapter 4

Chapter 4Chapter 4

Logic Gates and Boolean Algebra

Page 2: Chapter 4

Introduction

Logic gates are the actual physical implementations of the logical operators.

These gates form the basic building blocks for all digital logic circuits.

Logic gates process signals which represent true or false.

Page 3: Chapter 4

Introduction

Gates are identified by their function: NOT, AND, NAND, OR, NOR, EX-OR and EX-NOR.

Switch S1 OR Switch S2 (or both of them) must be closed

to light the lamp

Switch S1 AND Switch S2 must be closed to light the

lamp

Page 4: Chapter 4

Truth Table

A truth table is a means for describing how a logic circuit's output depends on the logic levels present at the circuit's inputs.

Page 5: Chapter 4

Logic Gates and Circuit Diagrams

OR Gate

Page 6: Chapter 4

Logic Gates and Circuit Diagrams

AND GateAND Gate

Page 7: Chapter 4

Logic Gates and Circuit Diagrams

NOT Gate

Page 8: Chapter 4

Logic Gates and Circuit Diagrams

NOR Gate

Page 9: Chapter 4

Logic Gates and Circuit Diagrams

NAND Gate

Page 10: Chapter 4

Logic Gates and Circuit Diagrams

EX-OR gateThe 'Exclusive-OR' gate is a circuit which will give a high output if either but not both, of its two inputs are high.

EX-NOR gateis The inversion of EX-OR Gate

Page 11: Chapter 4

Describing Logic Circuits Algebraically

Page 12: Chapter 4

Describing Logic Circuits Algebraically

Page 13: Chapter 4

Evaluating Logic Circuit Outputs

Page 14: Chapter 4

Evaluating Logic Circuit Outputs

Page 15: Chapter 4

Determining Output Level from a Diagram

Page 16: Chapter 4

Implementing Circuits From Boolean Expression

Page 17: Chapter 4

Boolean Algebra

Simplification of logical circuits. One tool to reduce logical

expressions is the mathematics of logical expressions.

The rules of Boolean Algebra are simple and straight-forward, and can be applied to any logical expression.

Page 18: Chapter 4
Page 19: Chapter 4

Boolean Algebra

Page 20: Chapter 4

Boolean Algebra

Page 21: Chapter 4

Boolean Algebra

AB(A + B’C +C)Solution:

ABA + ABB’C + ABCAB + 0 + ABCAB + ABCAB

(A’B(’)A+B)Solution:

(A + B( )’A + B)AA + B’A + AB + B’BA + B’A + ABA + ABA

Page 22: Chapter 4

Boolean Algebra

Page 23: Chapter 4

Universality of NAND & NOR Gates

Page 24: Chapter 4

Universality of NAND & NOR Gates

Page 25: Chapter 4

Alternate Logic Gate Representations

Page 26: Chapter 4

Forms and Definitions of Boolean Expressions

Page 27: Chapter 4

Product of Sums Representation

Page 28: Chapter 4

Disjunctive Normal Form

Page 29: Chapter 4

Disjunctive Normal Form

Page 30: Chapter 4

Disjunctive Normal Form

Page 31: Chapter 4

Disjunctive Normal Form

Using truth tables, convert this expression into a sum of minterms