digital logic mohammed salim ch4
TRANSCRIPT
![Page 1: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/1.jpg)
Digital Logic Design
IT101LGD
Prepared By
Asst. Lect. Mohammed Salim
Department of IT
1 LFU 2014
![Page 2: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/2.jpg)
Contents
LFU 20142
1- Rules of Boolean algebra.
2- Demorgan's theorems.
3- Sum of Product (SOP).
4- Product of Sum (POS).
![Page 3: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/3.jpg)
Introduction
LFU 20143
Logic Simplification :
A simplified Boolean expression which uses the
fewest gates possible to implement a given
expression.
Simplification methods:
Boolean algebra(algebraic method)
Karnaugh map(map method))
Quine-McCluskey(tabular method)
![Page 4: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/4.jpg)
Introduction
LFU 20144
Boolean Algebra: Mathematical tool to express
and analyze digital (logic) circuits
Laws of Boolean Algebra :
![Page 5: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/5.jpg)
Rules of Boolean Algebra
LFU 20145
![Page 6: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/6.jpg)
Rules of Boolean Algebra
LFU 20146
![Page 7: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/7.jpg)
Rules of Boolean Algebra
LFU 20147
Basic Functions
![Page 8: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/8.jpg)
Rules of Boolean Algebra
LFU 20148
Boolean Addition
Logical OR operation
Ex : Determine the values of A, B, C, and D that make the sum ‘0’
A+B’+C+D’
So all literals must be ‘0’ for the sum term to be ‘0’
A+B’+C+D’=0+1’+0+1’=0A=0, B=1, C=0, and D=1
Boolean Multiplication
Logical AND operation
Ex : Determine the values of A, B, C, and D for AB’CD’=1
So all literals must be ‘1’ for the product term to be ‘1’
AB’CD’=10’10’=1 A=1, B=0, C=1, and D=0
![Page 9: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/9.jpg)
Rules of Boolean Algebra
LFU 20149
![Page 10: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/10.jpg)
Laws of Boolean Algebra
LFU 201410
Commutative Law
the order of literals does not matter
A + B = B + A
A B = B A
![Page 11: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/11.jpg)
Laws of Boolean Algebra
LFU 201411
Associative Law
the grouping of literals does not matter
A + (B + C) = (A + B) + C (=A+B+C)
A(BC) = (AB)C (=ABC)
![Page 12: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/12.jpg)
Laws of Boolean Algebra
LFU 201412
Distributive Law
The distributive law is written for three variables as
follows: A(B + C) = AB + AC
![Page 13: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/13.jpg)
Rules of Boolean Algebra
LFU 201413
Below are the basic rules that are useful in
manipulating and simplifying Boolean expressions.
Rules 1 through 9 will be viewed in terms of their
application to logic gates. Rules 10 through 12 will be
derived in terms of the simpler rules and the laws
previously discussed.
![Page 14: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/14.jpg)
Rules of Boolean Algebra
LFU 201414
Rule 1: A + 0 = A
A variable ORed with 0 is always equal to the
variable. If the input variable A is 1, the output
variable X is 1, which is equal to A. If A is 0, the
output is 0, which is also equal to A.
![Page 15: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/15.jpg)
Rules of Boolean Algebra
LFU 201415
Rule 2: A + 1 = 1
A variable ORed with 1 is always equal to 1. A 1 on
an input to an OR gate produces a 1 on the output,
regardless of the value of the variable on the other
input.
![Page 16: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/16.jpg)
Rules of Boolean Algebra
LFU 201416
Rule 3: A . 0 = 0
A variable ANDed with 0 is always equal to 0. Any
time one input to an AND gate is 0, the output is 0,
regardless of the value of the variable on the other
input.
![Page 17: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/17.jpg)
Rules of Boolean Algebra
LFU 201417
Rule 4: A . 1 = A
A variable ANDed with 1 is always equal to the
variable. If A is 0 the output of the AND gate is 0. If A
is 1, the output of the AND gate is 1 because both
inputs are now 1s.
![Page 18: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/18.jpg)
Rules of Boolean Algebra
LFU 201418
Rule 5: A + A = A
A variable ORed with itself is always equal to the
variable. If A is 0, then 0+ 0 = 0; and if A is 1, then 1
+ 1 = 1.
![Page 19: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/19.jpg)
Rules of Boolean Algebra
LFU 201419
Rule 6: A + A = 1
A variable ORed with its complement is always equal
to 1. If A is 0, then 0 + 0 = 0 + 1 = 1. If A is l, then 1 +
1 = 1+ 0 = 1.
![Page 20: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/20.jpg)
Rules of Boolean Algebra
LFU 201420
Rule 7 : A . A = A
A variable ANDed with itself is always equal to the
variable. If A = 0, then 0.0 = 0; and if A = 1. then 1.1
= 1.
![Page 21: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/21.jpg)
Rules of Boolean Algebra
LFU 201421
Rule 8 : A . A = 0
A variable ANDed with its complement is always
equal to 0. Either A or A will always be 0: and when a
0 is applied to the input of an AND gate. The output
will be 0 also.
![Page 22: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/22.jpg)
Rules of Boolean Algebra
LFU 201422
Rule 9 : A = A
The double complement of a variable is always
equal to the variable. If you start with the variable A
and complement (invert) it once, you get A. If you
then take A and complement (invert) it, you get A ,
which is the original variable.
![Page 23: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/23.jpg)
Rules of Boolean Algebra
LFU 201423
Rule 10: A + AB = A
This rule can be proved by applying the distributive law,
rule 2, and rule 4 as follows:
A + AB = A( 1 + B) Factoring (distributive law)
= A . l Rule 2: (1 + B) = 1
= A Rule 4: A . 1 = A
![Page 24: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/24.jpg)
Rules of Boolean Algebra
LFU 201424
![Page 25: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/25.jpg)
Rules of Boolean Algebra
LFU 201425
![Page 26: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/26.jpg)
Demorgan's theorems
LFU 201426
DeMorgan, a mathematician who knew Boole,
proposed two theorems that are an important part of
Boolean algebra. In practical terms. DeMorgan‘s
theorems provide mathematical verification of the
equivalency of the NAND and negative-OR gates
and the equivalency of the NOR and negative-AND
gates.
![Page 27: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/27.jpg)
Demorgan's theorems
LFU 201427
The first DeMorgan's theorems is stated as follows:
The complement of two or more ANDed variables is equivalent
to the OR of the complements of the individual variables. The
formula for expressing this theorem for two variables is:
XY = X + Y
![Page 28: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/28.jpg)
Demorgan's theorems
LFU 201428
The second DeMorgan's theorem is stated as follows:
The complement of two or more ORed variables is
equivalent to the AND of the complements of the
individual variables, The formula for expressing this
theorem for two variables is
X + Y = X Y
![Page 29: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/29.jpg)
Demorgan's theorems
LFU 201429
![Page 30: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/30.jpg)
Demorgan's theorems
LFU 201430
![Page 31: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/31.jpg)
Demorgan's theorems
LFU 201431
![Page 32: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/32.jpg)
Demorgan's theorems
LFU 201432
Ex: Apply DeMorgan’s theorems to (XYZ)’ and
(X+Y+Z)’
Sol: (XYZ)’=X’+Y’+Z’ and (X+Y+Z)’=X’Y’Z’
Ex : Apply DeMorgan’s theorems to :
(a) ((A+B+C)D)’ (b) (ABC+DEF)’ (c)
(AB’+C’D+EF)’
Sol:
(a) ((A+B+C)D)’= (A+B+C)’+D’=A’B’C’+D’
(b) (ABC+DEF)’=(ABC)’(DEF)’=(A’+B’+C’)(D’+E’+F’)
(c)
(AB’+C’D+EF)’=(AB’)’(C’D)’(EF)’=(A’+B)(C+D’)(E’+
![Page 33: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/33.jpg)
SIMPLIFICATION USING BOOLEAN
ALGEBRA
LFU 201433
A simplified Boolean expression uses the fewest gates possible to implement a given expression.
Example, by using Boolean algebra techniques, simplify this expression:
AB + A(B + C) + B(B + C)
Solution:
Step 1: Apply the distributive law to the second and third terms in the
expression, as follows:
AB + AB + AC + BB + BC
Step 2: Apply rule 7 (BB = B) to the fourth term.
AB + AB + AC + B + BC
Step 3: Apply rule 5 (AB + AB = AB) to the first two terms.
AB + AC + B + BC
Step 4: Apply rule 10 (B + BC = B) to the last two terms.
AB + AC + B
Step 5: Apply rule 10 (AB + B = B) to the first and third terms.
B+AC
At this point the expression is simplified as much as possible, as shown in next page
![Page 34: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/34.jpg)
SIMPLIFICATION USING BOOLEAN ALGEBRA
LFU 201434
Simplification process by using Boolean Algebra
rules
![Page 35: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/35.jpg)
SIMPLIFICATION USING BOOLEAN ALGEBRA
LFU 201435
Ex : Simplify the following Boolean expression
(AB’(C+BD)+A’B’)C
Sol: (AB’C+AB’BD+A’B’)C=AB’CC+A’B’C=(A+A’)B’C=B’C
Ex : Simplify the following Boolean expression
A’BC+AB’C’+A’B’C’+AB’C+ABC
Sol: (A+A’)BC+(A+A’)B’C’+AB’C=BC+B’C’+AB’C =BC+B’(C’+AC)=BC+B’(C’+A)=BC+B’C’+AB’
Ex : Simplify the following Boolean expression
(AB +AC)’+A’B’C
Sol: (AB)’(AC)’+A’B’C=(A’+B’)(A’+C’)+A’B’C=A’+A’B’ +A’C’+B’C+A’B’C =A’(1+B’+C’+B’C)+B’C=A’+B’C’
![Page 36: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/36.jpg)
Standard Form of Boolean Expressions
LFU 201436
Boolean expression can be converted into one of 2
standard forms:
– The sum‐of‐products (SOP) form
Ex) AB+ABC, ABC+CDE+B’CD’
– The product‐of‐sums (POS) form
Ex) (A+B)(A+B+C), (A+B+C)(C+D+E)(B’+C+D’)
Standardization makes the evaluation, simplification, andimplementation of Boolean expressions more systematic andeasier
Product term = a term with the product (Boolean
multiplication) of literals
Sum term = a term with the sum (Boolean addition) of literals
![Page 37: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/37.jpg)
The Sum-of-Products (SOP) Form
LFU 201437
![Page 38: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/38.jpg)
The product‐of‐sums (POS) form
LFU 201438
![Page 39: Digital logic mohammed salim ch4](https://reader034.vdocuments.mx/reader034/viewer/2022042716/55ad6d6d1a28abb64b8b46ec/html5/thumbnails/39.jpg)
LFU 201439
End of Chapter 4
Note : Chapter 4 PowerPoint slides are quoted from Internet websites
and a variety of presentations.