Scribd
Upload
13 views16 pages

DLD Lecture 3,4,5 Boolean Algebra, Switching Algebra, and Logic Gates

Uploaded by

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

DLD Lecture 3,4,5 Boolean Algebra, Switching Algebra, and Logic Gates

Uploaded by

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

Boolean Algebra

Introduction
 1854: Logical algebra was published by George
Boole  known today as “Boolean Algebra”
 It’s a convenient way and systematic way of
expressing and analyzing the operation of
logic circuits.
 1938: Claude Shannon was the first to apply
Boole’s work to the analysis and design of logic
circuits.
Boolean Operations & Expressions
 Variable – a symbol used to represent a logical
quantity.
 Complement – the inverse of a variable and
is indicated by a bar over the variable.
 Literal – a variable or the complement of
a variable.
Boolean Addition
 Boolean addition is equivalent to the OR operation
0+0 = 0 0+1 = 1 1+0 = 1 1+1 = 1

 A sum term is produced by an OR operation with no


AND ops involved.
 i.e. A + B, A + B , A + B + C , A + B + C + D
 A sum term is equal to 1 when one or more of the literals in
the term are 1.
 A sum term is equal to 0 only if each of the literals is 0.
Boolean Multiplication
 Boolean multiplication is equivalent to the AND
operation
0·0 = 0 0·1 = 0 1·0 = 0 1·1 = 1

 A product term is produced by an AND operation with no


OR ops involved.
 i.e. AB, AB , ABC , ABCD
 A product term is equal to 1 only if each of the literals in
the term is 1.
 A product term is equal to 0 when one or more of the literals
are 0.
Laws & Rules of Boolean Algebra
 The basic laws of Boolean algebra:
 The commutative laws
 The associative laws
 The distributive laws
Commutative Laws
 The commutative law of addition for two
variables is written as: A+B = B+A
A
B A+B  B
A
B+A

 The commutative law of multiplication for


two variables is written as: AB = BA
A
B AB  B
A
B+A
Associative Laws
 The associative law of addition for 3 variables
is written as: A+(B+C) = (A+B)+C


A A A+B
A+(B+C)
B B
(A+B)+C
C B+C C

 The associative law of multiplication for 3 variables


is written as: A(BC) = (AB)C

A A AB
A(BC)
B B
(AB)C
C BC C
Distributive Laws
 The distributive law is written for 3 variables as follows:
A(B+C) = AB + AC

B A AB
B+C
C

B
X
X A
A C AC

X=A(B+C) X=AB+AC
Rules of Boolean Algebra

1.A + 0 = A 7.A • A = A
2.A +1 = 1 8.A • A = 0
3.A • 0 = 0 9.A = A
4.A •1 = A 10.A + AB = A
5.A + A = A 11.A + AB = A + B
6.A + A = 1 12.( A + B)( A + C) = A + BC

A, B, and C can represent a single variable or a combination of


variables.
Useful laws and theorems
Identity: A+0=A A•1=A
Null: A+1=1 A•0=0
Idempotent: A+A=A A•A=A
Involution: (A')' = A
Complementarity: A + A' = 1 A • A' = 0
Commutative: A+B=B+A A•B=B•A
Associative: (A+B)+C=A+(B+C) (A•B)•C=A•(B•C)
Distributive: A•(B+C)=(A•B)+(A•C) A+(B•C)=(A+B)•(A+C)
Absorption: A+A•B=A A•(A+B)=A
Absorption (#2): (A+B')•B=A•B (A•B')+B=A+B
DeMorgan’s Theorems
 DeMorgan’s theorems provide mathematical
verification of:
 the equivalency of the NAND and negative-OR
gates
 the equivalency of the NOR and negative-AND
gates.
DeMorgan’s Theorems
 The complement of two NAND Negative-OR
more
or ANDed variables is
equivalent to the OR of
the complements of the
X•Y=X+Y
individual variables.

 The complement of two or NOR


more ORed variables is Negative-AND
equivalent to the AND of
the complements of the X+Y=X•Y
individual variables.
DeMorgan’s Theorems (Exercises)
 Apply DeMorgan’s theorems to the expressions:

X•Y•Z
X + Y +Z
X+Y+Z
W•X•Y•Z
DeMorgan’s Theorems (Exercises)
 Apply DeMorgan’s theorems to the expressions:

( A + B + C)D
ABC + DEF
AB + CD + EF

A + BC + D(E + F )
Thank You…

You might also like