Scribd
Upload
90 views7 pages

Hassan Assignment 1 DLD

The document is an assignment on digital logic design that covers K-maps, truth tables, and Boolean expressions. It introduces K-maps as a method to minimize Boolean expressions without using Boolean algebra. K-maps with 2, 3, and 4 variables are discussed. For each, the number of cells in the K-map is specified based on the number of variables. Guidelines for grouping cells in K-maps to minimize expressions are provided. Truth tables and Boolean expressions for AND, OR, and NOT gates are also explained.

Uploaded by

sanee rajpoot
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
90 views7 pages

Hassan Assignment 1 DLD

The document is an assignment on digital logic design that covers K-maps, truth tables, and Boolean expressions. It introduces K-maps as a method to minimize Boolean expressions without using Boolean algebra. K-maps with 2, 3, and 4 variables are discussed. For each, the number of cells in the K-map is specified based on the number of variables. Guidelines for grouping cells in K-maps to minimize expressions are provided. Truth tables and Boolean expressions for AND, OR, and NOT gates are also explained.

Uploaded by

sanee rajpoot
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Name.

MUHAMMAD Hassan
Teacher Name. Taimoor Fazal
Class. ADP-CS(2)
Subject. Digital logic design
Date. 28/11/2020
Assignment NO.1
Topic:
 Introduction to K-Map
 Truth tables and Boolean Expressions
 Solve 2 variable boolean equation using K-Map
 Solve 3 variable boolean equation using K-Map
 Solve 4 variable boolean equation using K-Map
Introduction to K-Map:
So far we can see that applying Boolean algebra can be awkward in order to simplify
expressions. Apart from being laborious (and requiring the remembering all the laws)
the method can lead to solutions which, though they appear minimal, are not.

The Karnaugh map provides a simple and straight-forward method of minimizing


boolean expressions. With the Karnaugh map Boolean expressions having up to
four and even six variables can be simplified.

Definition:
A Karnaugh map (K-map) is a pictorial method used to minimize Boolean
expressions without having to use Boolean algebra theorems and equation
manipulations. A K-map can be thought of as a special version of a truth table .
Using a K-map, expressions with two to four variables are easily minimized.
Expressions with five to six variables are more difficult but achievable, and
expressions with seven or more variables are extremely difficult to minimize
using a K-map.

Simplification Guidelines for K-maps:

Always combine as many cells in a group as possible. This will result in the fewest
number of literals in the Term that represents the group.
Make as few groupings as possible to cover all Minterms. This will result in the
fewest product Terms.
Always begin with the largest group, which means if you can find eight members
group is better than two four groups and one four group is better than pair of
two-group.

Truth Tables:
A truthtable is a mathematical table used in logicspecifically in connection
with Boolean algebra, boolean functions, and propositional calculuswhich sets out
the functional values of logical expressions on each of their functional arguments,
that is, for each combination of values taken by their logical variables.

Boolean Expression:
A Boolean expression is a logical statement that is either true or False. Boolean
expressions can compare data of any type as long as both parts of the expression
have the same basic data type. You can test data to see if it is equal to, greater than,
or less than other data.

A Boolean expression can consist of Boolean data, such as the following:

 BOOLEAN values (YES and NO, and their synonyms, ON and OFF,


and TRUE and FALSE)
 BOOLEAN variables or formulas
 Functions that yield BOOLEAN results
 BOOLEAN values calculated by comparison operators
Truth Tables and Boolean Expression:
Truth tables and Boolean EAs well as a standard Boolean Expression, the input
and output information of any Logic Gate or circuit can be plotted into a standard
table to give a visual representation of the switching function of the system.
The table used to represent the boolean expression of a logic gate function is
commonly called a Truth Table. A logic gate truth table shows each possible input
combination to the gate or circuit with the resultant output depending upon the
combination of these input(s).
For example, consider a single 2-input logic circuit with input variables labelled as
A and B. There are “four” possible input combinations or 22 of “OFF” and “ON”
for the two inputs. However, when dealing with Boolean expressions and
especially logic gate truth tables, we do not general use “ON” or “OFF” but
instead give them bit values which represent a logic level “1” or a logic level “0”
respectively.
Then the four possible combinations of A and B for a 2-input logic gate is given as:
Input Combination (OFF – OFF) or ( 0, 0 )

Input Combination (OFF – ON) or ( 0, 1 )


Input Combination (ON – OFF) or ( 1, 0 )
Input Combination (ON – ON) or ( 1, 1 )
Therefore, a 3-input logic circuit would have 8 possible input combinations or 23
and a 4-input logic circuit would have 16 or 24, and so on as the number of inputs
increases. Then a logic circuit with “n” number of inputs would have 2n possible
input combinations of both “OFF” and “ON”.
So in order to keep things simple to understand, in this tutorial we will only deal
with standard 2-input type logic gates, but the principals are still the same for
gates with more than two inputs.
Truth Tables for Gates:
AND Gate:
For a 2-input AND gate, the output is true if BOTH input A “AND” input B are both
true.
Truth Table
A B A.B
0 0 0
0 1 0
1 0 0
1 1 1

Note that the Boolean Expression for a two input AND gate can be written as: A.B
or just simply AB without the decimal point.

OR Gate:
For a 2-input OR gate, the output is true if EITHER input A “OR” input B is true,
giving the Boolean Expression.

Truth Table:
A B A+B
0 0 0
0 1 1
1 0 1
1 1 1
Not Gate:
For a single input NOT gate, the output is ONLY true when the input is “NOT” true,
the output is the inverse or complement of the input giving the Boolean
Expression

Truth Table:
A Ā
0 1
1 0

2 -Variable K-Map:
The number of cells in 2 variable K-map is four, since the number of variables is
two. The following figure shows 2 variable K-Map.

When we are simplifying a Boolean equation using Karnaugh map, we represent


the each cell of K-map containing the conjunction term with. After that, we group
the adjacent cells with possible sizes as 2 or . In case of larger k-maps, we can
group the variables in larger sizes like 8 or 16.

The groups of variables should be in rectangular shape, that means the groups
must be formed by combining adjacent cells either vertically or horizontally.
Diagonal shaped or L-shaped groups are not allowed. The following example
demonstrates a K-map simplification of a 2-variable Boolean equation

3- Variable K-Map:
The number of cells in 3 variable K-map is eight, since the number of variables is
three. The following figure shows 3 variable K-Map.
A typical plot of a 3-variable K-map is shown below. It can be observed that the
positions of columns 10 and 11 are interchanged so that there is only change in
one variable across adjacent cells. This modification will allow in minimizing the
logic.

Up to 8 cells can be grouped in case of a 3-variable K-map with other possibilities


being 1,2 and 4.

4 Variable K-Map:

The number of cells in 4 variable K-map is sixteen, since the number of variables is
four. The following figure shows 4 variable K-Map.
There is only one possibility of grouping 16 adjacent min terms.
Let R1, R2, R3 and R4 represents the min terms of first row, second row, third row
and fourth row respectively. Similarly, C1, C2, C3 and C4 represents the min terms
of first column, second column, third column and fourth column respectively. The
possible combinations of grouping 8 adjacent min terms are {(R1, R2), (R2, R3),
(R3, R4), (R4, R1), (C1, C2), (C2, C3), (C3, C4), (C4, C1)}.
If w=0, then 4 variable K-map becomes 3 variable K-map.

You might also like