Digital Logic Design
Lecture 8
Boolean Algebra
Agenda
Table of Content
Properties of Boolean Algebra
Basic Operations in Boolean Algebra
Boolean Addition
Boolean Multiplication
Properties of Boolean Algebra Practice Problems
Solved Examples
1. Properties of Boolean Algebra
Boolean Algebra uses sets of rules known as laws or properties to analyze digital gates and circuits.
These laws help simplify complex Boolean expressions, reducing the number of logic gates required.
Variables are binary, taking values of either 0 or 1.
Expressions can involve multiple variables, but each variable can only be 0 or 1 (e.g., A + B = C).
2. Basic Operations in Boolean Algebra
Boolean Addition
Similar to the OR operation.
Computes the sum term without using the AND operation.
Evaluates to true if one or more literals are true, and false if all literals are false.
Examples: A + B, A’ + B, A’ + C’.
Boolean Multiplication
Similar to the AND operation.
Computes the product term without using the OR operation.
Evaluates to true only if all literals are true; otherwise, false.
Examples: A.C, A.D.E.
3. Properties of Switching Algebra (Boolean Algebra)
Also known as Switching Algebra, it is used to analyze digital gates and circuits.
Operates on binary numbers (0 and 1) using basic operators like AND (.) and OR (+).
Variables are represented by capital letters (e.g., A, B).
3. Properties of Switching Algebra (Boolean Algebra)
1. Annulment law
a variable ANDed with 0 gives 0, while a variable ORed with 1 gives 1, i.e.,
3. Properties of Switching Algebra (Boolean Algebra)
2. Identity law
In this law variable remains unchanged it is ORed with ‘0’ or ANDed with ‘1’,
i.e.,
3. Properties of Switching Algebra (Boolean Algebra)
3. Idempotent law
A variable remains unchanged when it is ORed or ANDed with itself, i.e.,
3. Properties of Switching Algebra (Boolean Algebra)
4. Complement law
In this Law if a complement is added to a variable it gives one, if a variable is
multiplied with its complement it results in ‘0’, i.e.,
3. Properties of Switching Algebra (Boolean Algebra)
5. Double Negation Law
A variable with two negations, its symbol gets cancelled out and original variable
is obtained, i.e.,
3. Properties of Switching Algebra (Boolean Algebra)
6. Commutative law
A variable order does not matter in this law, i.e.,
3. Properties of Switching Algebra (Boolean Algebra)
7. Associative law
The order of operation does not matter if the priority of variables are the same like
‘*’ and ‘/’, i.e.,
3. Properties of Switching Algebra (Boolean Algebra)
8. Distributive law
This law governs the opening up of brackets, i.e.,
3. Properties of Switching Algebra (Boolean Algebra)
9. Absorption law
The absorption law consists of two dual statements:
3. Properties of Switching Algebra (Boolean Algebra)
10. De Morgan law
In De Morgan law, the operation of an AND or OR logic circuit is unchanged if all
inputs are inverted, the operator is changed from AND to OR, and the output is
inverted, i.e.,
(A.B)’ = A’ + B’
(A+B)’ = A’.B’
4. Objective of Simplification
The primary objective is to simplify Boolean expressions to their simplest form.
Simplification ensures the final implementation of logic circuits is as simple as possible.
Reducing complexity increases efficiency and ease of implementation.
4. Objective of Simplification
5. Solved Examples
Question 1: Simplify A . B + A . B’.
Solution:
5. Solved Examples
Question 2: Simplify A + A’ . B.
Solution: D. Law
5. Solved Examples
Question 3: Simplify (A + B) . (A + B’) + (B . B’).
Solution: D. Law
5. Solved Examples
Question 4: Simplify A . (B + C) + A’ . (B + C)
Solution: Common,
5. Solved Examples
Question 5: Simplify A + B . A’ + C . C’
Solution: Dist. Law
6. Unsolved Problems
1. Simplify A + A . B.
2. Simplify (A . B) + (A . B’) + (B . B’).
3. Simplify A + B + A’ . B.
4. Simplify (A . B) + (A . B’) + (A’ . B).
5. Simplify A + B + A . B.
6. Simplify (A + B) . (A’ + B’).
7. Simplify A . (B + C) + A’ . (B + C).
8. Simplify A + B . A’ + C . C’.
9. Simplify A . B’ + A’ . B + B . C.
10. Simplify A . (B + B’).
7. Unsolved Problems Solution
7. Unsolved Problems Solution
7. Unsolved Problems Solution
7. Unsolved Problems Solution
