# Digital Electronics: Karnaugh Map (K-Map) : Binary to Gray Code Conversion

Dr. Manishika Jain- Join online Paper 1 intensive course. Includes tests and expected questions.

## Topics to be Covered

- Karnaugh Map (k-map)
- What is the need of k-map?
- Types of k-map
- SOP and POS simplification

Minterm 1

Maxterm 0

## Binary to Gray Code Conversion

## Types of K-Map

### Grouping

- Pair = 2
- Quad = 4
- Octet = 8
- Word = 16

**Examples**:

f (A, B, C) = ∑ m (0,3, 4,7)

f (A, B, C) = ∏ m (0,3, 4,7)

f (A, B, C, D) = ∑ (1, 3, 5,7, 9,11)

-Mayank