Module 5

Digital Logics
GEORGE BOOLE
 Boolean Algebra
• Boolean algebra is a different kind of algebra or rather can be said a
new kind of algebra which was invented by world-famous
mathematician George Boole in the year of 1854
• Boolean algebra is a system of mathematical logic to perform different
mathematical operations in a binary system
• It is one of the most basic tools available to the logic designer and thus
can be effectively used for simplification of complex logic expressions
• Boolean logic deals with only two variables, 1 and 0 by which all the
mathematical operations are to be performed
• In Boolean algebra, an expression given can also be converted into a
logic diagram using different logic gates like AND gate, OR gate and
NOT gate, NOR gates, NAND gates, XOR gates, XNOR gates
 Equivalent and Complement of Boolean Expressions
• Two given Boolean expressions are said to be equivalent if one of them
equals ‘1’ only when the other equals ‘1’ and also one equals ‘0’ only
when the other equals ‘0’
• They are said to be the complement of each other if one expression
equals ‘1’ only when the other equals ‘0’, and vice versa
• The complement of a given Boolean expression is obtained by
complementing each literal, changing all ‘.’ to ‘+’ and all ‘+’ to ‘.’, all 0s
to 1s and all 1s to 0s
 Dual of a Boolean Expression
• The dual of a Boolean expression is obtained by replacing all ‘.’
operations with ‘+’ operations, all ‘+’ operations with ‘.’ operations, all 0s
with 1s and all 1s with 0s and leaving all literals unchanged
Numerical Problem
Postulates of Boolean Algebra
Some basic laws for Boolean Algebra
Identity Law
Complementation Law
Commutative Law
Associative Law
Distributive Law
Theorems based on Distributive Law
Absorption Law or Redundancy Law
Consensus Theorem
 DeMorgan’s Theorem
• DeMorgan’s theorem states that the complement of a sum equals the
product of complements and the complement of a product equals the
sum of complements
 Transposition Theorem
• This theorem can be applied to any sum-of-products or product-of-
sums expression having two terms, provided that a given variable in
one term has its complement in the other.
 Involution Law
• Involution law says that the complement of the complement of an
expression leaves the expression unchanged. Also, the dual of the dual
of an expression is the original expression.
Numerical Problem
Numerical Problem
 Numerical Problem
Starting with the Boolean expression for a two-input OR gate, apply
Boolean laws and theorems to modify it in such a way as to facilitate the
implementation of a two-input OR gate by using two-input NAND gates
only.
 Numerical Problem
Starting with the Boolean expression for a two-input OR gate, apply
Boolean laws and theorems to modify it in such a way as to facilitate the
implementation of a two-input OR gate by using two-input NAND gates
only.
 Numerical Problem
Implement the given Boolean function by using basic logic gates
 Numerical Problem
Implement the given Boolean function by using basic logic gates
 Numerical Problem
Implement the Boolean function by using basic logic gates.
 Numerical Problem
Implement the Boolean function by using basic logic gates.
 Numerical Problem
Implement the Boolean function using basic logic gates. Also, determine
how many gates do you save after simplifying the given expression?
F  AB  A.B  B.C
 Numerical Problem
Implement the Boolean function using basic logic gates. Also, determine
how many gates do you save after simplifying the given expression?
F  AB  A.B  B.C
 Numerical Problem
Implement the Boolean function by using NAND gate.
 Numerical Problem
Implement the Boolean function by using NAND gate.

First, the given Boolean function or equation should be represented using

AND-OR gates
 Numerical Problem
Implement the Boolean function by using NAND gate.

In order to convert the AND gates into NAND gates, a bubble (complement) is
introduced at the output of the AND gate. To compensate the bubble, the input
of the next gate is also introduced with a bubble.
 Numerical Problem
Implement the Boolean function by using NAND gate.

To impose uniformity at the input, if a gate has one input with a bubble, the
other input is also introduced with a bubble. Again, in order to compensate the
bubble, the output of the preceding gate is introduced with bubble or
complement the literal.
 Numerical Problem
Implement the Boolean function by using NAND gate.

If an OR gate is not having any bubble at either of the inputs, bubbles are
introduced and are appropriately compensated
 Numerical Problem
Implement the Boolean function by using NAND gate.

An OR gate with two complemented inputs is equivalent to a NAND gate

(according to DeMorgan’s Law A’+B’ = (AB)’). Hence, replacing the OR gate,
which is having two complemented inputs, with NAND gate, we get the final
structure of the implementation of the Boolean function using NAND gates.
 Numerical Problem
Implement the Boolean function by using NOR gate.
 Numerical Problem
Implement the Boolean function by using NOR gate.
 Numerical Problem
• First, the given Boolean function or equation should be represented using
AND-OR gates
• In order to convert the OR gates into NOR gates, a bubble (complement) is
introduced at the output of the OR gate. To compensate the bubble, the input
of the next gate is also introduced with a bubble.
• To impose uniformity at the input, if a gate has one input with a bubble, the
other input is also introduced with a bubble. Again, in order to compensate the
bubble, the output of the preceding gate is introduced with bubble or
complement the literal.
• If an AND gate is not having any bubble at either of the inputs, bubbles are
introduced and are appropriately compensated
• An AND gate with two complemented inputs is equivalent to a NOR gate
(according to DeMorgan’s Law A’.B’ = (A+B)’). Hence, replacing the AND gate,
which is having two complemented inputs, with NOR gate, we get the final
structure of the implementation of the Boolean function using NOR gates.
 Numerical Problem
Implement the Boolean function by using NOR gate.