DIGITAL ELECTRONICS AND LOGIC DESIGNING

TOPIC – Binary Arithmatic,QUINE McCLUSKY'S

Method , Demorgan's Theorem, Universal
Logic gates

Submitted to- Mr. SANJESH GHORE

BINARY ADDITION
 EXAMPLE
STEP - 1 STEP - 2 STEP - 3

STEP - 4 STEP - 5 STEP - 6

 BINARY SUBTRACTION

RULES
1.
2.

3.
 EXAMPLE

1. PERFORM BINARY SUBSTRACTION OF 6 AND 10.

STEP - 1

STEP - 2
STEP - 3

STEP - 4

STEP - 5
STEP - 6

STEP - 7

ANS - 10000100
 DEMORGAN'S
THEOREM 1-
THEOREM
It states that the complement of a product of variables is equal to
the sum of the complements of the vaiables .

• Truth table- !(A.B)=!A+!B

A B !A !0B A.B !(A.B) !A+!B

0 0 1 1 0 1 1
0 1 1 0 0 1 1
1 0 0 1 0 1 1
1 1 0 0 1 0 0

• Logic diagram-
NOR Bubbled AND

!(A+B) !A.!B
 THEOREM 2- It states that the complement of sum of variables is
equal to the product of the complements of the variables.

• Truth Table-
!(A+B)=!A.!B
A B !A !B A+B !(A+B) !A.!B

0 0 1 1 0 1 1
0 1 1 0 1 0 0
1 0 0 1 1 0 0
1 1 0 0 1 0 0

• Logic Diagram-
NAND Bubbled OR

!A+!B !(A.B)
 UNIVERSAL LOGIC GATE
• Universal logic gates are the ones which can be used for implementing any gate like
AND ,OR and NOT , or any other combination of these basic gates . NAND and NOR gates
are known as universal gates, since any logic function can be implemented using NAND
or NOT gate.
1.NAND gate :- A logic circuit whose o/p is low when all inputs are high.

• Truth Table- • Logic diagram-

INPUT OUTPUT
A B Y=!(A.B)

0 0 1

0 1 1

1 0 1

1 1 0
2.NOR gate :- A logic circuit whose o/p is low when any one i/ps are high.
• TRUTH TABLE-

Logic diagram
A B Y=!(A+B)

0 0 1
0 1 0
1 0 0
1 1 0

1. Implementation of all basic gates using NAND gate :-

1.1 NOT gate (Inverter):-

Y=!(A.B)=!(X.X)=!X+!X=!X

1.2 AND gate :-

• Logic diagram- • Truth Table- A B !(A.B) Y=!!

(A.B)
0 0 1 0
0 1 1 0
Y=!(!AB) 1 0 1 0
1 1 0 1
 1.3 OR gate :-

Y=!(!A.!B)=A+B
• Truth Table:- • Logic Diagram-
A B !A.!B Y=!(!A.!B)
0 0 1 0
0 1 0 1
1 0 0 1
1 1 0 1

2. Implementation of all basic gates using NOR gate:-

2.1 NOT gate:-

• Logic diagram

Y=!(A+B)=!(X+X)=!X
 2.2 AND gate - 2.3 OR gate:-

Logic diagram
Logic diagram

Y=!(!A+!B)=A.B

Y=!(!(A+B))=A+B

• Truth Table- • Truth Table-

A B !A+!B A.B A B !(A+B) !(!(A+B))

0 0 1 0 0 0 1 0

0 1 1 0 0 1 0 1

1 0 1 0 1 0 0 1

1 1 0 1 1 1 0 1
 QUINE-McCLUSKEY
MINIMIZATION TECHNIQUE
•Modern digital systems are designed using complex programmable logic devices , field
programmable gate arrays and large scale integrated circuits that can be configured by the end
users.This devices are highly complex and therefore the techniques required for designing digital
systems using these devices have to be computer driven rather than manual. A logic minimization
technique which has the following characteristics is therefore , required:

1.Capability to handle large no. of variables

2.Does not depend on human user.
3.Ensure minimized expression.

•The Quine-McCluskey minimization techniques satisfies the above requirements and hence
can be effectively used to design logic circuits . The K-map technique is not suitable for
handling the design of complex digital systems because of following disadvantages:

1.Minimization of logic functions involving more than six variables is unwieldy.

2.Recognition of prime implicants that relies on the ability of the human user making it
difficult to be sure whether the best selection has been made.
Quine-McClusky Minimization Procedure

This is basically a tabular method of minimization and as much it is suitable for computer
applications. The procedure for optimization as follows:
Step 1: Describe individual minterms of the given expression by their equivalent binary
numbers.

Step 2: Form a table by grouping numbers with equivalent number of 1’s in them, i.e. first
numbers with no 1’s, then numbers with one 1, and then numbers with two 1’s, … etc.

Step 3: Compare each number in the top group with each minterm in the next lower group. If
the two numbers are the same in every position but one, place a check sign to the right of both
numbers to show that they have been paired and covered. Then enter the newly formed
number in the next column (a new table). The new number is the old numbers but where the
literal differ, an “_” is placed in the position of that literal.

Step 4: Using (3) above, form a second table and repeat the process again until no further
pairing is possible. (On second repeat, compare numbers to numbers in the next group that have
the same “_” position.

Step 5: Terms which were not covered are the prime implicants and are OR ed and AND ed
together to form final function.
Note: The procedure above gives you the prime implicant but not essential prime
 Prime Implicants
• A product term that cannot have any of its
variables removed and still imply the logic
function is called a prime implicant.

Q. Simplify using Quine-McCluskey:f(A,B,C,D)=∑m(0,1,2,3,4,5,6,7)

Sol.:
Minterm W X Y Z
0 O O O 0
1 0 0 1 0
2 0 1 0 1
3 1 1 1 0
4 1 O O 1
5 1 0 1 1
6 1 1 0 1
7 1 1 1 1
 Finding Prime Implicants
Step 1 Step 2 Step 3

0 0000 (0,1) 000- (0,1,2,3) 00-- X

1 0001 (0,2) 00-0
2 0010 (0,2,1,3) 00-- X
(0,8) -000
8 1000 (0,2,8,10) -0-0 X
(1,3) 00-1
3 0011
5 0101 (1,5) 0-01 (0,8,2,10) -0-0 X
10 1010 (2,3) 001-
7 0111 (1,5,3,7) 0—1 X
(2,10) -010
14 1110 (1,3,5,7) 0—1 X
(8,10) 10-0
15 1111 (3,7) 0-11 6 Prime Implicants
(5,7) 01-1
1-10 00--
(10,14) 1-10 X
-111 -0-0
(7,15) -111 X 111- 0--1
(14,15) 111- X
 Find Essential Prime Implicants
Prime Covered Minterms
Implicant minterms
0 1 2 3 5 7 8 10 14 15

1-10 10,14 X X

7,15 X X
-111
X X
111- 14,15

00— 0,1,2,3 X X X X

0,2,8,10 X X X X
-0-0
X X X X
0--1 1,3,5,7

F = !WZ+WXY+!X!Z
 Prime Implicants
F = !WZ+WXY +!X!Z
YZ
WX 00 01 11 10

00 1 1 1 1
0--1
01 1 1
!WZ

11 1 1
111-
10 1 1
!X!Z
WXY
-0-0