Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
5 views7 pages

K Map Simplification

A Karnaugh Map (K-map) is a graphical tool used to simplify Boolean algebra expressions, particularly effective for 4-6 variables. It involves specific grouping rules, such as no diagonal grouping and groups must be powers of 2. An example demonstrates the simplification process for a 3-variable K-map, resulting in a final expression of F = B + C.

Uploaded by

tanishqpatel053
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
5 views7 pages

K Map Simplification

A Karnaugh Map (K-map) is a graphical tool used to simplify Boolean algebra expressions, particularly effective for 4-6 variables. It involves specific grouping rules, such as no diagonal grouping and groups must be powers of 2. An example demonstrates the simplification process for a 3-variable K-map, resulting in a final expression of F = B + C.

Uploaded by

tanishqpatel053
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/ 7

Karnaugh Map (K-map)

Simplification
Basics, Rules, and Examples
What is a K-map?
• • A graphical tool to simplify Boolean algebra
expressions.
• • Reduces complex logic circuits into simpler
ones.
• • Works best for up to 4–6 variables.
• • Uses Gray code ordering of cells.
Rules of Grouping
• • No diagonal grouping.
• • Groups must be powers of 2 (1, 2, 4, 8...).
• • Always make maximum grouping possible.
• • Adjacent = neighbours (up, down, left, right,
wrap-around).
• • Overlapping groups are allowed.
2-variable K-map
• | AB | 0 | 1 |
• |----|---|---|
• | 0 | m0 | m1 |
• | 1 | m2 | m3 |
3-variable K-map
• | AB\C | 0 | 1 |
• |------|---|---|
• | 00 | m0 | m1 |
• | 01 | m3 | m2 |
• | 11 | m7 | m6 |
• | 10 | m4 | m5 |
4-variable K-map
• | AB\CD | 00 | 01 | 11 | 10 |
• |-------|----|----|----|----|
• | 00 | m0 | m1 | m3 | m2 |
• | 01 | m4 | m5 | m7 | m6 |
• | 11 | m12| m13| m15| m14|
• | 10 | m8 | m9 | m11| m10|
Example: 3-variable Simplification
• F(A,B,C) = Σm(1,2,3,5,7)

• Steps:
• 1. Place 1’s in K-map for given minterms.
• 2. Group adjacent 1’s (powers of 2).
• 3. Derive terms from constant variables.
• 4. Final simplified expression: F = B + C

You might also like