Scribd
Upload
9 views

Karnaugh Maps Simplifying Boolean Logic

Uploaded by

Asad Dawood Aziz
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
9 views

Karnaugh Maps Simplifying Boolean Logic

Uploaded by

Asad Dawood Aziz
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Karnaugh Maps:

Simplifying
Boolean Logic
Karnaugh maps, also known as K-maps, are a powerful tool in
digital logic design for simplifying Boolean algebra expressions.
Developed by Maurice Karnaugh in 1953, these diagrams provide
a visual method to minimize logical functions and reduce the
complexity of digital circuits. In this presentation, we'll explore
the fundamentals of Karnaugh maps, starting with two-variable
K-maps and progressing to three-variable K-maps, uncovering
their structure, application, and benefits in logical design.

TH
BY ASAD DAWOOD
Two-Variable Karnaugh Maps: The
Basics
Structure
A two-variable K-map consists of a 2x2 grid, representing all possible combinations
of two binary variables (A and B). Each cell corresponds to a specific input
combination.

Variable Assignment
The top row represents A=0, bottom row A=1. The left column represents B=0,
right column B=1. This arrangement ensures adjacent cells differ by only one
variable.

Cell Values
Each cell contains either a 0 or 1, representing the output of the Boolean function
for that specific input combination. These values are derived from the truth table.

Simplification
By identifying adjacent cells with 1s, we can group them to form larger rectangles,
leading to simplified Boolean expressions and reduced logic gates in the circuit.
Mapping Truth Tables to Two-
Variable K-Maps
1 Create Truth Table
Start by constructing a truth table for your Boolean function, listing all
possible input combinations and their corresponding outputs.

2 Draw K-Map Grid


Create a 2x2 grid for the two-variable K-map, labeling the rows and
columns with the variable values (0 and 1).

3 Fill in K-Map Cells


Transfer the output values from the truth table to the corresponding cells
in the K-map, matching the input combinations.

4 Verify Mapping
Double-check that each cell in the K-map correctly represents the output
for its corresponding input combination from the truth table.
Grouping in Two-Variable K-Maps
1 Adjacent Cells
In a two-variable K-map, cells are considered adjacent if they differ by only
one variable. This includes cells on opposite edges of the map, which are
considered logically adjacent.

2 Group Sizes
Valid groups in a two-variable K-map can be 1, 2, or 4 cells. Each group size
corresponds to a term in the simplified Boolean expression: 1 cell (two
literals), 2 cells (one literal), 4 cells (constant 1).

3 Overlapping Groups
It's allowed and often necessary to have overlapping groups. This ensures all
1s are covered and leads to the most simplified expression.

4 Prime Implicants
The largest possible groups that can't be completely contained within another
group are called prime implicants. These form the basis of the simplified
Boolean expression.
Three-Variable Karnaugh Maps:
Expanding the Grid
Structure Variable Assignment Cell Values and Grouping

A three-variable K-map expands Typically, variable A is assigned As with two-variable K-maps,


to a 2x4 grid, representing all 8 to rows (2 rows: A=0, A=1), cells contain 0s or 1s based on
possible combinations of three while B and C are assigned to the function's output. Grouping
binary variables (A, B, and C). columns (4 columns: 00, 01, 11, follows similar rules but now
This layout maintains the 10). This specific order of allows for larger groups: 1, 2, 4,
crucial property of adjacent column values (Gray code) or 8 cells. The goal remains to
cells differing by only one ensures adjacent cells differ by create the largest possible
variable. only one variable change. groups of adjacent 1s.
Gray Code in Three-Variable
K-Maps
Decimal Binary Gray Code

0 000 000

1 001 001

2 010 011

3 011 010

4 100 110

5 101 111

6 110 101

7 111 100
Advanced Grouping in Three-Variable K-Maps
Identify All 1s
Start by locating all cells containing 1s in the three-variable K-map. Remember, the goal is to cover all 1s with the fewest, largest possible groups.

Form Largest Groups


Create the largest possible rectangular or square groups of adjacent 1s. Valid group sizes are 1, 2, 4, or 8 cells. Remember that cells on opposite edges are
considered adjacent.

Consider L-Shaped Groups


In three-variable K-maps, L-shaped groups of 4 cells are valid and often necessary for optimal simplification. These groups wrap around the edges of the map.

Minimize Overlap
While some overlap is often necessary, aim to minimize it. Each group should contribute at least one unique 1 that isn't covered by other groups.

Derive Simplified Expression


Translate each group into a term in the Boolean expression. The final simplified expression is the OR (sum) of all these terms.
Applications and Benefits of Karnaugh Maps

Logic Simplification
K-maps provide a visual method to simplify complex Boolean expressions, reducing the number of terms and
variables needed to represent a logic function.

Circuit Optimization
By minimizing Boolean expressions, K-maps lead to optimized digital circuits with fewer logic gates, reducing cost,
power consumption, and propagation delay.

Educational Tool
K-maps serve as an excellent teaching aid for understanding Boolean algebra, logic minimization, and the
principles of digital circuit design.

Error Detection
K-maps can help identify errors in logic design by providing a clear visual representation of a function, making
inconsistencies or mistakes more apparent.

You might also like