Scribd
Upload
141 views

K Map

The document discusses circuit simplification using Karnaugh maps (K-maps). It explains that a K-map is a pictorial method for grouping Boolean expressions with common factors to eliminate unwanted variables. It provides steps for constructing a K-map, which involves placing 1s and 0s in a truth table and then grouping adjacent cells containing 1s according to certain rules to arrive at a simplified Boolean expression. An example K-map is shown, with ones grouped to obtain the Boolean expression .

Uploaded by

siti ismail
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
141 views

K Map

The document discusses circuit simplification using Karnaugh maps (K-maps). It explains that a K-map is a pictorial method for grouping Boolean expressions with common factors to eliminate unwanted variables. It provides steps for constructing a K-map, which involves placing 1s and 0s in a truth table and then grouping adjacent cells containing 1s according to certain rules to arrive at a simplified Boolean expression. An example K-map is shown, with ones grouped to obtain the Boolean expression .

Uploaded by

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

Circuit Simplification

Using KARNAUGH
MAPS (K-MAPS)
K-Map introduction
• A K-map is a pictorial method of grouping together expressions with
common factors and then eliminating unwanted variables.
• A K-map is a two-dimensional truth-table. Note that the squares are
numbered so that the binary representations for the numbers of two
adjacent squares differ in exactly one position.
• Alternative to applying the Boolean Laws and rules to obtain the
simplified Boolean expression
Construction of KMap
Step 1: Place the 1s and 0s in the table
A B C Y
0 0 0 0
0 0 1 0
0 1 0 1 BC
0 1 1 0 A 00 01 11 10
1 0 0 1 0  0 0  0   1
1 0 1 0
1 1 0 1 1 1   0 0   1
1 1 1 0
Step 2: Group together adjacent cells containing
1’s according to the rules below
• Groups must contain 1, 2, 4, 8, 16 (2n) cells
• Groups must contain only 1 (and X if don't care
A isBCallowed)
00 01 11 10
• Groups may be horizontal or vertical, but not diagonal
0    
• Groups should be as large as possible
1      
• Each cell containing a 1 must be in at least one group
• Groups may overlap
• Groups may wrap around the table. The leftmost cell in a row may be grouped with the
rightmost cell and the top cell in a column may be grouped with the bottom cell
• There should be as few groups as possible
Example:
•  In the green loop in Figure 35, the
inputs A and C are not changing, A
is (0), C is (1). Hence, the Boolean
term will be .
• While for the output in the red loop,
inputs B and C are not changing, B
is (0), C is (1). Hence, the Boolean
term will be .
• As the grouping is done for ones, the
Boolean expression will be a sum of
Example
• Write the Boolean expression of the following K-map:

Grouping the ones


Rubrics

You might also like