Chapter 3: GateLevel Minimization - PowerPoint PPT Presentation

About This Presentation
Title:

Chapter 3: GateLevel Minimization

Description:

Truth table of fn is unique but fn can be in many different algebraic forms ... Adjacent cells represent minterms that differs by only one variable. ... – PowerPoint PPT presentation

Number of Views:43
Avg rating:3.0/5.0
Slides: 31
Provided by: RPy1
Category:

less

Transcript and Presenter's Notes

Title: Chapter 3: GateLevel Minimization


1
Chapter 3 Gate-Level Minimization
  • Topics in this Chapter
  • The Map Method
  • Two-Variable Map
  • Three- Variable Map
  • Four/Five variable Map
  • Dont Care Conditions
  • Product of Sums Simplification
  • Implementing NAND and NOR circuits

2
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.

3
Two-Variable Map
  • A fn variable have 2n minterms (cells)

4
(No Transcript)
5
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,z) ? (2,3,4,5)

6
Another example F(x,y,z) ?(3,4,6,7)
7
(No Transcript)
8
(No Transcript)
9
(No Transcript)
10
Four variable Map
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
(No Transcript)
23
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 (it is one input
    NAND gate) or complement the input literal

24
(No Transcript)
25
(No Transcript)
26
(No Transcript)
27
(No Transcript)
28
Implementing NOR circuits
  • To convert multilevel AND-OR to all NOR
  • Convert all ORs with OR-invert
  • 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 gate)
    or complement the input literal

29
(No Transcript)
30
(No Transcript)
Write a Comment
User Comments (0)
About PowerShow.com