CSC201: Digital Logic Design
Level 2 – 1st Semester
Digital Logic Design
Section (4)
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Application to the lecture:
1. Boolean Rules.
2. DE Morgan’s Theory.
Agenda
Practical part:
1. Create (Half & Full) Subtractor circuit.
CSC201: Digital Logic Design
Level 2 – 1st Semester
Boolean Rules
CSC201: Digital Logic Design
Level 2 – 1st Semester
Boolean Algebra:
Boolean algebra is the basic mathematics used for logic design.
Boolean algebra provides basis for logic operating using.
Binary Variable are represented by Alphabetic characters.
Each Binary Variable used in Boolean algebra can have only two values (Binary 1 for True and
Binary 0 for False).
Boolean algebra helps in circuit reduction and simpler design.
Boolean Operations:
There are 3 types of Boolean Operations:
1. Logical ORing Operation ( Logical Addition ) .
2. Logical ANDing Operation ( Logical Multiplication ) .
3. Logical Complement Operation ( Reverse ) .
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Boolean Operations:
Complement of a variable is represented by an overbar/Dash ( ). Thus,
complement of variable B is represented as B .
Thus if B = 0 then B = 1 and if B = 1 then B = 0 .
A A
A A 0 1
NOT
1 0
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Boolean Operations:
ORing of the variables is represented by a plus (+) sign between them.
For example: ORing of A, B, C is represented as A + B + C .
A B A+B
0 0 0
OR 0 1 1
1 0 1
1 1 1
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Boolean Operations:
ANDing of the variables is represented by a dot (.) between them such as
A.B.C. Sometime the dot may be omitted like ABC.
A B A.B
0 0 0
AND 0 1 0
1 0 0
1 1 1
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra: ( AND Properties):
Consider X is variable X :
A B Y A B Y A A Y
1 0 0 0 0 0 0 0 0
1 1 1 0 1 0 1 1 1
If B = 0 : B . 1 = ? 0.1=0 If B = 0 : B . 0 = ? 0.0=0 If B = 0 : B . B = ? 0.0=0
If B = 1 : B . 1 = ? 1.1=1 If B = 1 : B . 0 = ? 1.0=0 If B = 1 : B . B = ? 1.1=1
X.1=X X.0=0 X. X=X
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra:
Laws & Theorems OR AND
1 Identity Law X.1=X
2 Dominance Law X.0=0
3 Idempotent Law X.X=X
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra: ( OR Properties):
Consider X is variable X :
A B Y A B Y A A Y
1 0 1 0 0 0 0 0 0
1 1 1 0 1 1 1 1 1
If B = 0 : B + 1 = ? 0+1=1 If B = 0 : B + 0 = ? 0+0=0 If B = 0 : B + B = ? 0+0=0
If B = 1 : B + 1 = ? 1+1=1 If B = 1 : B + 0 = ? 1+0=1 If B = 1 : B + B = ? 1+1=1
X+1=1 X+0=X X+ X=X
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra:
Laws & Theorems OR AND
1 Identity Law X+1=1 X.1=X
2 Dominance Law X+0=X X.0=0
3 Idempotent Law X+X=X X.X=X
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra: (Involution / Double Negation Law):
If B = 0 : (B) =1 A A
NOT
If B = 1 : (B) =0
If B = 0 : (B) =0 A A A
NOT NOT
If B = 1 : (B) =1
(X)=X
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra:
Laws & Theorems OR AND
1 Identity Law X+1=1 X.1=X
2 Dominance Law X+0=X X.0=0
3 Idempotent Law X+X=X X.X=X
4 Double Negation Law (X)=X
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra: (Complementation Law in AND):
Consider X is variable X :
A B Y
1 0 0
1 1 1 X.X=0
If B = 0 : B . B = ? 0.1=0
If B = 1 : B . B = ? 1.0=0
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra:
Laws & Theorems OR AND
1 Identity Law X+1=1 X.1=X
2 Dominance Law X+0=X X.0=0
3 Idempotent Law X+X=X X.X=X
4 Double Negation Law (X)=X
Complementation /
5 X.X=0
Negation Law
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra: (Complementation Law in OR):
Consider X is variable X :
A B Y
1 0 1
1 1 1 X+X=1
If B = 0 : B + B = ? 0+1=1
If B = 1 : B + B = ? 1+0=1
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra:
Laws & Theorems OR AND
1 Identity Law X+1=1 X.1=X
2 Dominance Law X+0=X X.0=0
3 Idempotent Law X+X=X X.X=X
4 Double Negation Law (X)=X
Complementation /
5 X+X=1 X.X=0
Negation Law
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra:
Laws & Theorems OR AND
1 Identity Law X+1=1 X.1=X
2 Dominance Law X+0=X X.0=0
3 Idempotent Law X+X=X X.X=X
4 Double Negation Law (X)=X
Complementation /
5 X+X=1 X.X=0
Negation Law
6 Commutative Law X+Y=Y+X X.Y=Y.X
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra:
Laws & Theorems OR AND
7 Associative Law X+(Y+Z)=(X+Y)+Z X(Y.Z)=(X.Y)Z
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra:
Laws & Theorems OR AND
7 Associative Law X+(Y+Z)=(X+Y)+Z X(Y.Z)=(X.Y)Z
8 Distributive Law X+Y.Z =(X+Y)(X+Z) X(Y+Z)=X.Y+X.Z
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra: (Absorption Law in OR):
Proof : X + X . Y = X
Right Side :
X+X.Y Take X as Common Factor
X(1+Y) Identity Law
X.1 Identity Law
X
So Right Side = Left Side .
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra:
Laws & Theorems OR AND
7 Associative Law X+(Y+Z)=(X+Y)+Z X(Y.Z)=(X.Y)Z
8 Distributive Law X+Y.Z =(X+Y)(X+Z) X(Y+Z)=X.Y+X.Z
9 Absorption Law X+XY=X
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra: (Absorption Law in AND):
Proof : X ( X + Y ) = X
Right Side :
X(X+Y) Distributive Law
X.X+X.Y Identity Law
X+X.Y Take X as Common Factor
X(1+Y) Identity Law
X
So Right Side = Left Side .
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra:
Laws & Theorems OR AND
7 Associative Law X+(Y+Z)=(X+Y)+Z X(Y.Z)=(X.Y)Z
8 Distributive Law X+Y.Z =(X+Y)(X+Z) X(Y+Z)=X.Y+X.Z
9 Absorption Law X+XY=X X(X+Y)=X
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
DE Morgan Theorem
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra: (DE Morgan Theorem in AND)
A.B=A+B
A B A.B A.B A B A B A+B
0 0 0 1 0 0 1 1 1
0 1 0 1 = 0 1 1 0 1
1 0 0 1 1 0 0 1 1
1 1 1 0 1 1 0 0 0
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra:
Laws & Theorems OR AND
7 Associative Law X+(Y+Z)=(X+Y)+Z X(Y.Z)=(X.Y)Z
8 Distributive Law X+Y.Z =(X+Y)(X+Z) X(Y+Z)=X.Y+X.Z
9 Absorption Law X+XY=X X(X+Y)=X
10 De Morgan Theorem (XY)=X+Y
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra: (DE Morgan Theorem in OR)
A+B=A.B
A B A+B A+B A B A B A.B
0 0 0 1 0 0 1 1 1
0 1 1 0 = 0 1 1 0 0
1 0 1 0 1 0 0 1 0
1 1 1 0 1 1 0 0 0
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Rules in Boolean Algebra:
Laws & Theorems OR AND
7 Associative Law X+(Y+Z)=(X+Y)+Z X(Y.Z)=(X.Y)Z
8 Distributive Law X+Y.Z =(X+Y)(X+Z) X(Y+Z)=X.Y+X.Z
9 Absorption Law X+XY=X X(X+Y)=X
10 De Morgan Theorem (X+Y)=X Y (XY)=X+Y
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Practical Part
CSC201: Digital Logic Design
Level 2 – 1st Semester
Subtractor:
• Subtractor: in electronics, an subtractor is a digital circuit that performs
the subtraction of numbers.
• in modern computers, subtractors reside in the arithmetic logic unit
(ALU).
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
A Difference
Half Subtractor
B Borrow
Types of Subtractor:
1. Half Subtractor.
A
2. Full Subtractor. Difference
B
Full Subtractor
Borrow Out
Borrow in
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Half Subtractor:
• The most basic arithmetic operation is the subtraction of two binary digits.
• This simple addition consists of four possible elementary operations:
0-0=0
0-1=1 (Borrow 1)
1-0=1
1-1=0
• Half subtractor: is a combinational circuit that performs the subtraction of
two bits.
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Half Subtractor:
• Let us consider x and y as the inputs to the half adder as Diff and
Borrow are the outputs.
x y Diff Borrow
Diff = x . y + x . y = x + y 0 0 0 0
0 1 1 1
XOR Gate
1 0 1 0
1 1 0 0
Borrow = x . y Truth table for half subtractor
AND Gate
Eng. Norhan Ahmed
A
CSC201: Digital Logic Design Difference
Level 2 – 1st Semester B Full Subtractor
Borrow Out
Borrow in
Full Subtractor:
• Full Subtractor is one of the most important blocks of an ALU.
• Full Subtractor: performs the subtraction of three bits (two significant
bits and previous borrow).
• To create a full Subtractor we implement two half Subtractors.
Borrow-in Diff
Diff
Half Sub
A Diff Borrow
Borrow-Out
Half Sub
B
Borrow
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Full Subtractor:
• Let us consider x, y and (Borrow-in = z) as the inputs to the half subtractor
as Diff and Borrow-out are the outputs. x y z Diff Borrow-out
0 0 0 0 0
0 0 1 1 1
Diff = ( x + y) + z
0 1 0 1 1
0 1 1 0 1
1 0 0 1 0
1 0 1 0 0
Borrow-out = ( x + y)z+xy
1 1 0 0 0
1 1 1 1 1
Truth table for Full subtractor
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Compression between subtractor Types (Half subtractor & Full
subtractor ):
Half subtractor Full subtractor
It is used for 2-bit subtraction. It is used for 3-bit subtraction.
One Ex-OR gate, one Not gate and one AND gate are used. One Ex-OR gate, two NOT gates , two AND gates, and one OR gate are
used.
Output is the Difference of two signals. Output is the Difference of three signals.
Half subtractor circuit is simple. Full subtractor circuit is complicated.
There are two input and two output terminals. There are three input terminals and two output terminals.
It cannot be used as a full subtractor. It can be used as a half subtractor.
Example: Calculators, computers, digital measuring devices, etc. Example: Multiple bit subtraction, digital processors, etc.
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Any Questions
Eng. Norhan Ahmed
CSC201: Digital Logic Design
Level 2 – 1st Semester
Thank You
Eng. Norhan Ahmed
