SANJIVANI COLLEGE OF ENGINEERING

(An Autonomous Institution)

(Approved by AICTE, New Delhi, Accredited by NBA, Accredited ‘A’ Grade by NAAC &
Affiliated to Savithribai Phule University)
Kopargaon – 423 603, Maharashtra.

L29
LECTURE HANDOUTS

Electrical I/I

Course Name with Code : ES1003 / BEEE

Course Faculty : Dr.G.Vijayakumar

Unit : V – Analog and Digital Electronic Circuits

Date of Lecture:

Topic of Lecture: Boolean Algebra: Rules, laws and De-Morgan’s Theorems. Simplification of
Boolean Expressions.
Introduction :

Gate circuit can be expressed using a common method is known as a truth table.
This table includes all the input logic state combinations either high (1) or low (0)
for every input terminal of the logic gate through the equivalent output logic level
like high or low. The NOT logic gate circuit is shown above and its truth table is
extremely easy indeed

The truth tables of logic gates are very complex but larger than the NOT gate. The
truth table of each gate must include many rows like there are possibilities for
exclusive combinations for inputs. For instance, for the NOT gate, there are two
possibilities of inputs either 0 or 1, whereas, for the two-input logic gate, there are
four possibilities like 00, 01, 10 & 11. Therefore, it includes four rows for the
equivalent truth table.

For a 3-input logic gate, there are 8 possible inputs like 000, 001, 010, 011, 100,
101, 110 & 111. Therefore, a truth table including 8 rows is required.
Mathematically, the required number of rows in the truth table is equivalent to 2
increased to the power of the no. of i/p terminals.
Prerequisite knowledge for Complete understanding and learning of Topic:
 Logic Gates
The basic Laws of Boolean Algebra that relate to the Commutative Law allowing a
change in position for addition and multiplication, the Associative Law allowing the
removal of brackets for addition and multiplication, as well as the Distributive
Law allowing the factoring of an expression, are the same as in ordinary algebra.
Each of the Boolean Laws above are given with just a single or two variables, but
the number of variables defined by a single law is not limited to this as there can be
an infinite number of variables as inputs too the expression. These Boolean laws
detailed above can be used to prove any given Boolean expression as well as for
simplifying complicated digital circuits.
A brief description of the various Laws of Boolean are given below
with A representing a variable input.
Description of the Laws of Boolean Algebra
 Annulment Law – A term AND‘ed with a “0” equals 0 or OR‘ed with a “1” will
equal 1
o A . 0 = 0    A variable AND’ed with 0 is always equal to 0
o A + 1 = 1    A variable OR’ed with 1 is always equal to 1

 Identity Law – A term OR‘ed with a “0” or AND‘ed with a “1” will always equal
that term
o A + 0 = A   A variable OR’ed with 0 is always equal to the variable
o A . 1 = A    A variable AND’ed with 1 is always equal to the variable

 Idempotent Law – An input that is AND‘ed or OR´ed with itself is equal to

that input
o A + A = A    A variable OR’ed with itself is always equal to the variable
o A . A = A    A variable AND’ed with itself is always equal to the variable

 Complement Law – A term AND‘ed with its complement equals “0” and a

term OR´ed with its complement equals “1”
o A . A = 0    A variable AND’ed with its complement is always equal to 0
o A + A = 1    A variable OR’ed with its complement is always equal to 1

 Commutative Law – The order of application of two separate terms is not

important
o  A . B = B . A    The order in which two variables are AND’ed makes no
difference
o A + B = B + A    The order in which two variables are OR’ed makes no
difference

 Double Negation Law – A term that is inverted twice is equal to the original
term
o  A = A     A double complement of a variable is always equal to the
variable

Analysis
The voltage signals in the digital circuits are represented with binary values like 0’s
& 1’s calculated in reference to ground. The deficiency of voltage mainly signifies a
“0” whereas the existence of full DC supply voltage signifies a “1”.
A logic gate is a special type of amplifier circuit that is mainly designed for input as
well as output logic level voltages. Logic gate circuits are most frequently
symbolized with a schematic diagram through their own exclusive symbols Instead
of their essential resistors and transistors.
Just like with Op-Amps (operational amplifiers), the connections of power supply to
logic gates are frequently misplaced in schematic diagrams for the benefit of
simplicity. It includes the probable input logic level combinations through their
particular output logic levels.

What is the Easiest Way to Learn Logic Gates?

The easiest way to learn the function of basic logic gates is explained below.
 For AND Gate – If both the inputs are high then the output is also high
 For OR Gate – If a minimum of one input is high then the output is High
 For XOR Gate – If the minimum one input is high then only the output is
high
 NAND Gate – If the minimum one input is low then the output is high
 NOR Gate – If both the inputs are low then the output is high.
De Morgan’s Theorem
The first theorem of DeMorgan states that the logic gate like NAND is equal to an
OR gate with a bubble. The logic function of the NAND gate is
A’B = A’+B’
The second theorem of DeMorgan states that the NOR logic gate is equal to an AND
gate with a bubble. The logic function of NOR gate is
(A+B)’= A’. B’

The Conversion of NAND Gate

The NAND gate can be formed using AND gate & NOT gate. The Boolean expression
& truth table is shown below.

A B Y′=A⋅B Y
0 0 0 1
0 1 0 1
1 0 0 1
1 1 1 0
Y= (A⋅B)’

NOR Gate Conversion

The NOR gate can be formed using OR gate & NOT gate. The Boolean expression &
truth table is shown below.

A B Y′ = A+B Y
0 0 0 1
0 1 1 0
1 0 1 0
1 1 1 0

Y = (A+B)’

Ex-OR Gate Conversion

The Ex-OR gate can be formed using NOT, AND & OR gate. The Boolean expression
& truth table is shown below. This logic gate can be defined as the gate that gives
high output once any input of this is high. If both the inputs of this gate are high
then the output will be low.

A B  Y
0 0 0
0 1 1
1 0 1
1 1 0

Y=A⊕B or A’B+AB’

Ex-NOR Gate Conversion

The Ex-NOR gate can be formed using EX-OR gate & NOT gate. The Boolean
expression & truth table is shown below. In this logic gate, when the output is high
“1” then both the inputs will be either “0” or “1”.
 A B Y
0 0 1
0 1 0
1 0 0
1 1 1

Y = (A’B + AB’)’

Video Content / Details of website for further learning :

https://whatis.techtarget.com/definition/logic-gate-AND-OR-XOR-NOT-NAND-NOR-and-XNOR
https://www.youtube.com/watch?v=okZBqPd1xd4
https://www.youtube.com/watch?v=wGilEPBfcT8
https://technobyte.org/logic-gates-simple-deriving-using-nand-nor/
Important Books/Journals for further learning
Edward Hughes, “Electrical Technology”, Sevent Edition, Pearson Education.
B L Theraja, Electrical Technology, Chand Publications, New Delhi

Course Faculty