The Map Method

1
The Map Method

• Truth table of fn is unique but fn can be in
  many different algebraic forms
• Simplification by using boolean algebra is often
  difficult because we dont know how to proceed
• Map method or Karnaugh map (K_Map) is simple and
  straightforward method that produces minimum
  number of terms.

2
Two-Variable Map

• A fn variable have 2n minterms (cells)

3
(No Transcript)
4
Three- Variable Map

• Adjacent cells represent minterms that differs by
  only one variable. Therefore, adjacent cells are
  identical except for one variable that appears
  complemented in one cell and uncomplemented in
  the adjacent cell.
• Example F(x,y,x) ? (2,3,4,5)

5
Another example F(x,y,z) ?(3,4,6,7)
6
(No Transcript)
7
(No Transcript)
8
(No Transcript)
9
Four variable Map
10
(No Transcript)
11
(No Transcript)
12
(No Transcript)
13
(No Transcript)
14
(No Transcript)
15
(No Transcript)
16
(No Transcript)
17
(No Transcript)
18
(No Transcript)
19
(No Transcript)
20
(No Transcript)
21
(No Transcript)
22
Multilevel NAND circuits

• To convert multilevel AND-OR to all NAND
• Convert all ANDs with AND-invert
• Convert all ORs with invert-OR
• Check the bubbles in diagrams if any of them is
  not compensated by another small circle along the
  same line insert an inverter(One input NAND) or
  complement the input literal

23
(No Transcript)
24
(No Transcript)
25
(No Transcript)
26
(No Transcript)
27
Implementing NOR circuits

• To convert multilevel AND-OR to all NOR
• Convert all ORs with invert-OR
• Convert all ANDs with invert-AND
• Check the bubbles in diagrams if any of them is
  not compensated by another small circle along the
  same line insert an inverter(One input NOR) or
  complement the input literal

28
(No Transcript)
29
(No Transcript)