• What is Logic?
Logic is the science of reasoning and decision making.
• Logic primarily involves the combination of 2 operations - ‘OR’ and
‘AND’.
o OR logic deals with if any one of the given conditions are valid.
o AND logic deals with if all of the given conditions are valid.
• Under logic there is a branch that deals with binary operations - where
there are only 2 outcomes, a YES or a NO. Or in other terms, ON/OFF,
TRUE/FALSE, HIGH/LOW, 1/0. This is known as Binary Logic.
• Designing modules that can make use of such inputs to take decisions
just like us is called Binary Logic Design.
• In such design, if the module broadly deals with the combination of
various inputs to take a decision it is called Combinational Logic
Design.
Like so,
• What is Binary Arithmetic?
Just like how we deal with the ‘decimal’ number system with 10 digits - 0
through 9 (like the fingers of our hands), we deal with number systems
with other bases too.
For binary logic, since we only have 2 outcomes it is convenient to have a
number system with base 2 - this is the Binary Number System.
Doing operations on such numbers is known as Binary Arithmetic. It is
also known as Boolean Logic or Boolean Arithmetic.
In binary arithmetic, we only have 2 digits - 0 and 1. Just like how we use
10 as the base in our decimal system we use the powers of 2 to construct
numbers in the binary system.
Like so,
• Boolean Algebra - 2 inputs
▪ The ‘OR’ operation is similar to addition in base-2, and is thus
also denoted by a ‘+’ sign.
▪ The ‘AND’ operation is similar to multiplication in base-2, and is
thus also denoted by a ‘*’ sign.
• Boolean Algebra - 3 inputs
▪ ‘OR’ Operator, i.e. A+B+C = Z
▪ ‘AND’ Operator, i.e. A*B*C = Z
• Boolean Algebra - ‘NOT’ Operation
This operator is also called Inversion and Negation. It takes an input and
inverts it to the other value, i.e. 0 becomes 1 and 1 becomes 0.
▪ NOT(A) = Y
• Boolean Algebra - Some
Observations
▪ X+X=X
▪ X*X=X
▪ 1+X=1
▪ 1*X=X
▪ 0+X=X
▪ 0*X=0
▪ NOT(NOT(X)) = X
• Boolean Algebra - Truth Tables
Truth Tables are tabulated visualizations that display all possible input
combinations for a binary logic operation along with the evaluated
outputs.
Note: When two output columns of the truth
table are same, the two operations are said to be
equal!
• Boolean Algebra - Redundancy
Theorem
▪ X + Y = X + NOT(X) * Y (as shown in the truth table below)
X Y X+Y NOT(X) NOT(X) * Y X + NOT(X) * Y
0 0 0 1 0 0
0 1 1 1 1 1
1 0 1 0 0 1
1 1 1 0 0 1
• Boolean Algebra - De Morgan
Theorems
▪ NOT(X + Y) = NOT(X) * NOT(Y)
X Y X+Y not(X + Y) not(X) not(Y) not(X) * not(Y)
0 0 0 1 1 1 1
0 1 1 0 1 0 0
1 0 1 0 0 1 0
1 1 1 0 0 0 0
▪ NOT(X * Y) = NOT(X) + NOT(Y)
X Y X*Y NOT(X * Y) NOT(X) NOT(Y) NOT(X) + NOT(Y)
0 0 0 1 1 1 1
0 1 0 1 1 0 1
1 0 0 1 0 1 1
1 1 1 0 0 0 0
• Boolean Algebra - NOR and NAND:
Universal Operations
▪ NOR = NOT(X + Y) [Invert the ‘OR’ operation of X,Y]
▪ NAND = NOT(X * Y) [Invert the ‘AND’ operation of X,Y]
o Relations obtained from NAND Operation:
▪ X NAND X = NOT(X)
X NOT(X) X*X X NAND X
0 1 0 1
0 1 0 1
1 0 1 0
1 0 1 0
▪ (X NAND X) NAND (Y NAND Y) = X + Y
X Y X+Y X NAND X Y NAND Y (X NAND X) (X NAND X)
* NAND
(Y NAND Y) (Y NAND Y)
0 0 0 1 1 1 0
0 1 1 1 0 0 1
1 0 1 0 1 0 1
1 1 1 0 0 0 1
▪ (X NAND Y) NAND (X NAND Y) = X * Y
X Y X*Y X NAND Y (X NAND Y) * (X NAND Y) NAND
(X NAND Y) (X NAND Y)
0 0 0 1 1 0
0 1 0 1 1 0
1 0 0 1 1 0
1 1 1 0 0 1
• Assignment:
o Relations obtained from NOR Operation:
▪ X NOR X = not(X)
X not(X) X+X X NOR X
0 1 0 1
0 1 0 1
1 0 1 0
1 0 1 0
▪ (X NOR X) NOR (Y NOR Y) = X * Y
X Y X*Y X NOR X Y NOR Y (X NOR X) + (X NOR X) NOR
(Y NOR Y) (Y NOR Y)
0 0 0 1 1 1 0
0 1 0 1 0 1 0
1 0 0 0 1 1 0
1 1 1 0 0 0 1
▪ (X NOR Y) NOR (X NOR Y) = X + Y
X Y X + Y X NOR X Y NOR Y (X NOR Y) * (X NOR Y)
(X NOR Y) NOR
(X NOR Y)
0 0 0 1 1 1 0
0 1 1 1 0 0 1
1 0 1 0 1 0 1
1 1 1 0 0 0 1
o Relations obtained from NOR Operation:
▪ X NOR X = not(X)
X not(X) X+X X NOR X
0 1 0 1
0 1 0 1
1 0 1 0
1 0 1 0
▪ (X NOR X) NOR (Y NOR Y) = X * Y
X Y X*Y X NOR X Y NOR Y (X NOR X) + (X NOR X) NOR
(Y NOR Y) (Y NOR Y)
0 0 0 1 1 1 0
0 1 0 1 0 1 0
1 0 0 0 1 1 0
1 1 1 0 0 0 1
▪ (X NOR Y) NOR (X NOR Y) = X + Y
X Y X + Y X NOR X Y NOR Y (X NOR Y) * (X NOR Y)
(X NOR Y) NOR
(X NOR Y)
0 0 0 1 1 1 0
0 1 1 1 0 0 1
1 0 1 0 1 0 1
1 1 1 0 0 0 1