Scribd
Upload
66 views20 pages

Module 4 - Boolean Algebra

This document discusses Boolean algebra and digital circuits. It defines Boolean operations like OR, AND and provides properties and rules like Demorgan's theorems, commutative and distributive laws. It explains how to analyze combinational logic gates using Boolean expressions and discusses sum of products and product of sums forms. Standard forms like sum of products and product of sums are defined where every variable must appear in each term. Examples are given to convert expressions to the standard forms.

Uploaded by

Kejeindrran
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
66 views20 pages

Module 4 - Boolean Algebra

This document discusses Boolean algebra and digital circuits. It defines Boolean operations like OR, AND and provides properties and rules like Demorgan's theorems, commutative and distributive laws. It explains how to analyze combinational logic gates using Boolean expressions and discusses sum of products and product of sums forms. Standard forms like sum of products and product of sums are defined where every variable must appear in each term. Examples are given to convert expressions to the standard forms.

Uploaded by

Kejeindrran
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 20

DIGITAL

CIRCUITS
(EEE3821)
BOOLEAN ALGEBRA
CONTENT

Sum of
Rules of
DeMorgan’s Products /
Boolean
Theorem Product of
Algebra
Sums
BOOLEAN ADDITION
• Boolean addition is Boolean Additive Properties
equivalent to the OR A+0=A
operation. A+1=1
• The sum term is 1 if one or A+A=A
more if more inputs are 1. A+ A ഥ=1
• The sum term is zero only if A + AB = A
all inputs are 0. A+AഥB = A + B

Determine the values of A, B, and C if:


𝐴ҧ + 𝐵 + 𝐶ҧ = 0
BOOLEAN MULTIPLICATION
• Boolean multiplication is Boolean Additive Properties
equivalent to the AND A .0 = 0
operation. A .1 = A
• The product term will be 1 A. A=A
only if inputs are 1. A. Aഥ=0
A . (A + B) = A
A. A ഥ + B = A .B

What are the values of A, B and C if:


𝐴.ҧ 𝐵. 𝐶ҧ = 1
COMMUTATIVE
LAWS
ASSOCIATIVE
LAWS
DISTRIBUTIVE
LAWS A
AB
B B
B+ C
C X
X A
A AC
C
RULES OF BOOLEAN ALGEBRA
RULES #9
A + AB
= A (1 + B)(based Distributive Laws)
RULES = A.1 (1 + B = 1 based on Rule #2)
= A ( A.1 = A based on Rule #4)
#10
A+AB
= (A + A B) + A B (A = A + AB based on Rule #10)

RULES = (A A + A B) + A B (A = A A based on Rule #7)


=AA+AB+AA+AB

#11 (adding A A = 0 based on Rule # 8)


= (A + A) (A + B) (Factoring based on Rule #12)
= 1 . (A + B) ( A + A = 1 based on Rule #6)
= A + B (based on Rule #4)
(A + B)(A + C)
= AA + AC + AB + BC (based on Distributive Law)

RULES = A + AC + AB + BC (AA = A based on Rule #7)


= A(1 + C) + AB + BC (based on Distributive Law)

#12 = A.1 + AB + BC (1 + C = 1 based on Rule #2)


= A (1 + B) + BC (based on Distributive Law)
= A . 1 + BC (1 + B = 1 based on Rule #2)
= A + BC (A.1 = A based on Rule #4)
D E M O R G A N ’ S
1 S T T H E O R E M
F O R N A N D

Inputs Output
A B AB A + B
0 0 1 1
0 1 1 1
1 0 1 1
1 1 0 0
D E M O R G A N ’ S
2 N D T H E O R E M
F O R N O R

Inputs Output
A B A + B AB
0 0 1 1
0 1 0 0
1 0 0 0
1 1 0 0
OTHER
DE
MORGAN’S
EQUIVALENT
BOOLEAN ANALYSIS OF COMBINATIONAL
LOGIC GATES
Combinational logic
circuits can be
analyzed by writing
the expression for
each gate and
combining the C A+B +D=C A ഥ .B
ഥ +D
expressions (based on DeMorgan’s Theorem)
according to the =Aഥ .B
ഥ .C + D
rules for Boolean
algebra.
SUM OF PRODUCTS PRODUCT OF SUMS
An expression is in SOP form An expression is in POS form
when two or more product when two or more sum terms are
terms are summed as in the multiplied as in the following
following example: examples
SUM OF PRODUCTS (SOP) STANDARD FORM
• In SOP standard form, every variable in the domain must appear
in each product term.
• For example, convert to standard form X = (Aഥ .B
ഥ) + (A . B . C)

X= A ഥ .B
ഥ + A.B .C
= A ഥ .B
ഥ (C + Cത ) + A . B . C
(C + Cത = 1 based on Rule #6)
= A ഥ .B
ഥ . C + (Aഥ .B
ഥ . Cത ) + A . B . C
(based on Distributive Law)
PRODUCT OF SUMS (POS) STANDARD FORM
• In POS standard form, every variable in the domain must appear
in each sum term.
• For example, convert to standard form X = A ഥ+Bഥ . (A + B + C)

X= A ഥ+B ഥ . (A + B + C)
= A ഥ+B ഥ + C . Cത . A + B + C
(C. Cത = 0 based on Rule #8)
= A ഥ+B ഥ + C (A ഥ+B ഥ + Cത ) A + B + C
(based on Distributive Law)

You might also like