Scribd
Upload
53 views31 pages

Logic Gates and Boolean Algebra

This document chapter discusses logic gates and Boolean algebra. It introduces logic gates as physical implementations of logical operators that process true and false signals. The chapter describes common logic gates like AND, OR, NOT, NAND and NOR. It explains how truth tables describe a circuit's output based on inputs and shows diagrams of logic gate circuits. The chapter also covers describing logic circuits algebraically, evaluating outputs, simplifying expressions using Boolean algebra rules and representing circuits in product of sums and disjunctive normal form.

Uploaded by

Yellasiri Suresh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
53 views31 pages

Logic Gates and Boolean Algebra

This document chapter discusses logic gates and Boolean algebra. It introduces logic gates as physical implementations of logical operators that process true and false signals. The chapter describes common logic gates like AND, OR, NOT, NAND and NOR. It explains how truth tables describe a circuit's output based on inputs and shows diagrams of logic gate circuits. The chapter also covers describing logic circuits algebraically, evaluating outputs, simplifying expressions using Boolean algebra rules and representing circuits in product of sums and disjunctive normal form.

Uploaded by

Yellasiri Suresh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 31

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.

Introduction

Gates are identified by their


function: NOT, AND, NAND, OR,
NOR, EX-OR and EX-NOR.

Switch S1 AND Switch S2


must be closed to light the
lamp

Switch S1 OR Switch S2 (or


both of them) must be closed
to light the lamp

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.

Logic Gates and Circuit


Diagrams

OR Gate

Logic Gates and Circuit


Diagrams

AND Gate

Logic Gates and Circuit


Diagrams

NOT Gate

Logic Gates and Circuit


Diagrams

NOR Gate

Logic Gates and Circuit


Diagrams

NAND Gate

Logic Gates and Circuit


Diagrams

EX-OR gate
The '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 gate

is The inversion of EX-OR Gate

Describing Logic Circuits


Algebraically

Describing Logic Circuits


Algebraically

Evaluating Logic Circuit


Outputs

Evaluating Logic Circuit


Outputs

Determining Output Level


from a Diagram

Implementing Circuits
From Boolean Expression

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.

Boolean Algebra

Boolean Algebra

Boolean Algebra
(A+B)(AB)
:Solution
(A + B( )A + B)
AA + BA + AB + BB
A + BA + AB
A + AB
A

AB(A + BC +C)
:Solution
ABA + ABBC + ABC
AB + 0 + ABC
AB + ABC
AB

Boolean Algebra

Universality of NAND & NOR


Gates

Universality of NAND & NOR


Gates

Alternate Logic Gate


Representations

Forms and Definitions of


Boolean Expressions

Product of Sums
Representation

Disjunctive Normal Form

Disjunctive Normal Form

Disjunctive Normal Form

Disjunctive Normal Form

h tables, convert this expression into a sum of minterms

You might also like