Scribd
Upload
9 views26 pages

DLD Chapter 4 Part I NEW

Chapter 4 of the Digital Logic Design course covers Boolean algebra and logic simplification, explaining fundamental concepts such as Boolean operations, variables, complements, and the laws of Boolean algebra. It includes DeMorgan's theorems, which illustrate the equivalency of NAND and NOR gates, and provides methods for constructing truth tables and simplifying logic expressions. The chapter emphasizes the importance of Boolean algebra in analyzing and designing digital logic circuits.

Uploaded by

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

DLD Chapter 4 Part I NEW

Chapter 4 of the Digital Logic Design course covers Boolean algebra and logic simplification, explaining fundamental concepts such as Boolean operations, variables, complements, and the laws of Boolean algebra. It includes DeMorgan's theorems, which illustrate the equivalency of NAND and NOR gates, and provides methods for constructing truth tables and simplifying logic expressions. The chapter emphasizes the importance of Boolean algebra in analyzing and designing digital logic circuits.

Uploaded by

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

Wachemo University

Department of Electrical and


Computer Engineering
Digital Logic Design(DLD)

Chapter 4: Boolean Algebra and Logic Simplification


Boolean operation and expression
• Boolean algebra is the mathematics of digital logic.
• Variable :
• symbol used to represent an action, a condition, or data.
• Any single variable can have only a 1 or a 0 value.
• Complement
• the inverse of a variable
• It is indicated by a bar over the variable (overbar) or a prime symbol (A’)
• Example, the complement of the variable A is
• If A = 1, then = 0. If A = 0, then = 1.
• Sometimes a prime symbol rather than an overbar is used to denote the complement of
a variable; for example, B’ indicates the complement of B. In this book, only the overbar
is used.
• A literal is a variable or the complement of a variable
Boolean Addition
• Boolean addition is equivalent to the OR operation

Example :
• Determine the values of A, B, C, and D that make the sum term equal to 0
• Determine the values of A and B that make the sum term equal to 0
Boolean Multiplication
• Boolean multiplication is equivalent to the AND operation.

Examples
• Determine the values of A, B, C, and D that make the product term equal to 1
Laws and Rules of Boolean Algebra
• The basic laws of Boolean algebra—are the same as in ordinary
algebra
• The commutative laws for addition and multiplication
• The associative laws for addition and multiplication
• The distributive law
Commutative Laws

The commutative law of addition The commutative law of multiplication

• This law states that the order in • This law states that the order in
which the variables are ‘OR’ed which the variables are ANDed
makes no difference. makes no difference.
Associative Laws

The associative law of addition The associative law of multiplication


• This law states that when • This law states that it makes no
‘OR’ing more than two variables, difference in what order the
the result is the same regardless variables are grouped when
of the grouping of the variables. ‘AND’ing more than two variables.
Rules of Boolean Algebra
Rule 1: Rule 4 :

Rule 2 : Rule 5 :

Rule 3 : Rule 6 :
Rule 7 :

Rule 8 :

Rule 9 :
Rule 10 :
Rule 11:
Rule 12:
DeMorgan’s Theorems
• 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
DeMorgan’s first theorem
Theorm Gate equivalence and truth table
• The complement of a product of
variables is equal to the sum of
the complements of the
variables.
• In another way this means,
• The complement of two or more
ANDed variables is equivalent to
the OR of the complements of the
individual variables.
• Formula
DeMorgan’s second theorem
Therom Gate equivalence and truth table
• The complement of a sum of
variables is equal to the product
of the complements of the
variables.
• Stated another way,
• The complement of two or more
ORed variables is equivalent to the
AND of the complements of the
individual variables.
• formula
Examples and Exercise
Examples :
Apply DeMorgan’s theorems to the following expressions

Solutions

Exercise:
Apply DeMorgan’s theorem to the expression
Example:
• The Boolean expression for an exclusive-OR gate is AB+AB. With this as a starting point, use
DeMorgan’s theorems and any other rules or laws that are applicable to develop an expression
for the exclusive-NOR gate.
Solution:
Boolean Analysis of Logic Circuits
• Boolean algebra provides a concise way to express the operation of a
logic circuit formed by a combination of logic gates so that the output
can be determined for various combinations of input values.
Boolean Expression for a Logic Circuit
• To derive the Boolean expression for a given combinational logic circuit, begin at the left-
most inputs and work toward the final output, writing the expression for each gate.
Example : (Use the figure below )
1. The expression for the left-most AND gate with inputs C and D is CD.
2. The output of the left-most AND gate is one of the inputs to the OR gate and B is the other input.
Therefore, the expression for the OR gate is B + CD.
3. The output of the OR gate is one of the inputs to the right-most AND gate and A is the other input.
Therefore, the expression for this AND gate is A(B + CD), which is the final output expression for the entire
circuit
Constructing a Truth Table for a
Logic Circuit
• Once the Boolean expression for a given logic circuit has been
determined, a truth table that shows the output for all possible values
of the input variables can be developed. The procedure requires that
you evaluate the Boolean expression for all possible combinations of
values for the input variables.
Constructing a Truth Table for a Logic Circuit (cont…)
• In the case of the circuit in the figure there are four
input variables (A, B, C, and D)
• combinations

Evaluating the Expression Summarize,


• To evaluate the expression A(B + CD), first find the The expression A(B+CD)=1 when
values of the variables that make the expression equal • A=1 and B=1 regardless of the
to 1, values of C and D
• In this case, the expression equals 1 • or when A=1 and C=1 and D=1
only if A = 1 and B + CD = 1 regardless of the value of B.
• Now determine when the B+CD term equals 1. • The expression A(B+CD)=0 for
• The term B+CD=1 if all other value combinations of
either B=1 or CD=1 or if both B and CD equal 1 the variables
• The term CD=1
only if C=1 and D=1.
Constructing a Truth Table for a Logic Circuit (cont…)
Logic Simplification Using Boolean
Algebra
• A logic expression can be reduced to its simplest form or changed to a
more convenient form to implement the expression most efficiently
using Boolean algebra.
• This method depends on a thorough knowledge of Boolean algebra
and considerable practice in its application, not to mention a little
ingenuity and cleverness.
Example
• Using Boolean algebra techniques, simplify this expression: AB + A(B + C) + B(B + C)
Solution:
Example

• Simplify the following Boolean expression:

You might also like