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

Doorsteptutor material for UGC is prepared by world's top subject experts: Get detailed illustrated notes covering entire syllabus: point-by-point for high retention.

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

Binary to Gray Code Conversion

Binary to Gray Code Conversion

Loading image

Types of K-Map

Grouping

  • Pair = 2

  • Quad = 4

  • Octet = 8

  • Word = 16

Types of K-Map: Grouping

Types of K-Map: Grouping

Loading image
Types of K-Map: Grouping

Types of K-Map: Grouping

Loading image

Examples:

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

Types of K-Map: Grouping

Types of K-Map: Grouping

Loading image

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

Types of K-Map: Grouping

Types of K-Map: Grouping

Loading image

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

Types of K-Map: Grouping

Types of K-Map: Grouping

Loading image