Download presentation

Presentation is loading. Please wait.

1
**Chapter 3 Gate-Level Minimization**

2
**3.1 Introduction The purposes of this chapter**

To understand the underlying mathematical description and solution of the problem To enable you to execute a manual design of simple circuits To prepare you for skillful use of modern design tools Introduce a HDL that is used by modern design tools

3
**3.2 The Map Method Karnaugh map (K-map)**

Pictorial form of a truth table To present a visual diagram of a function expressed in standard form

4
Two-variable Map

5
**Example: f(x,y) = m1+m2+m3 = x’y+xy’+xy = x + y**

6
Three-variable Map

7
Example 3-1

8
Example 3-2

9
Example 3-3

10
Example 3-4

11
3.3 Four-Variable Map

12
**The Adjacent Squares of Four-Variable Map**

One square: one minterm, a term of four literals Two adjacent squares: a term of three literals Four adjacent squares: a term of two literals Eight adjacent squares: a term of one literal Sixteen adjacent squares: 1

13
Example 3-5

14
Example 3-6

15
**PI and EPI A prime implicant(PI) An essential PI (EPI)**

a product term obtained by combining the maximum possible number of adjacent sqaures in the K-map An essential PI (EPI) If a minterm in a square is covered by only one PI.

16
Example F(A,B,C,D) =(0,2,3,5,7,8,9,10,13,15)

17
3.4 Five-Variable Map

18
**Relationship between Squares and Literals**

19
Example 3-7

20
**3.5 Product of Sums Simplification**

Get F’ by 0’s Apply DeMorgan’s theorem to F’

21
**Example 3-8 Simplify the following Function into SOP and POS F(A,B,C,D)= (0,1,2,5,8,9,10)**

22
**Example 3-8 (con’t) F = B’D’+B’C’+A’C’D’ F’ = AB + CD + BD’**

23
**Implementation of Example 3-8**

24
**How to express the Table 3-2**

25
**How to express the Table 3-2 (con’t)**

F(x,y,z) = ∑ (1,3,4,6) F(x,y,z) = ∏ (0,2,5,7)

26
**Map for the Function of Table 3-2**

F= x’z+xz’ F’=xz+x’z’ F=(x’+z’)(x+z)

27
3.6 Don’t Care Conditions A don’t care minterm is a combination of variables whose logical value is not specified. The don’t care minterms may be assumed to be either 0 or 1. An X is used for representing the don’t care minterm.

28
Example 3-9

29
**3.7 NAND and NOR Implementation**

The NAND or the NOR gate Universal gate Basic gates of used in all IC digital families

30
**Why is the NAND Gate Universal?**

31
**Two Graphic Symbols for NAND Gate**

32
**Two-Level Implementation**

33
Example 3-10

34
**Multilevel NAND Circuits**

35
**Implementation of F=(AB’+A’B)(C+D’)**

36
**Why is the NOR Gate Universal?**

37
**Two Graphic Symbols for NOR Gate**

40
**3.8 Other Two-Level Implementation**

Wired-AND logic Wired-OR logic

41
AND-OR-INVERT

42
OR-AND-INVERT

43
Tabular Summary

44
Example 3-11

45
**3.9 Exclusive-OR Function**

x y = xy’+x’y (x y)’ =xy+x’y’ x 0 = x x 1 = x’ x x = x x’ = 1 x y’ = x’ y = (x y)’ A B = B A (A B) C = A (B C) = A B C

46
XOR Implementation

47
**Map for a 3-Input Odd function and Even function**

48
**3-Input Odd and Even Functions**

49
**Map for a 4-Input Odd function and Even function**

50
Even Parity Generator

51
Even Parity Checker

52
**Logic Diagram of a Parity Generator and Checker**

53
**3.10 Hardware Description Language (HDL)**

HDL : a documentation language Logic simulator: representation of the structure and the behavior of a digital logic systems through a computer Logic synthesis: the process of driving a list of components and their connections from the model of a digital system described in HDL

54
**Two Standard HDLs Supported by IEEE**

VHDL Verilog HDL : is chosen for this book

55
**Verilog HDL module endmodule // : comment notation input output wire**

and or not # time unit `timescale: compiler directive

57
**HDL Example 3.2 module circuit_with_delay (A,B,C,x,y); input A,B,C**

output x,y; wire e; and #(30) g1(e,A,B); or #(20) g3(x,e,y); not #(10) g2(y,C); endmodule

59
**HDL Example 3-3 module simcrct; reg A, B, C; wire x, y;**

circuit_with_delay (A,B,C,x,y); initial begin A = 1 `b0; B = 1`b0; C=1`b0; #100 A = 1 `b1; B = 1`b1; C=1`b1; #100 $finish end endmodule

61
**User-Defined Primitives**

primitive endprimitive table endtable HDL Example 3-5

Similar presentations

OK

Introduction Gate-level minimization refers to the design task of finding an optimal gate-level implementation of Boolean functions describing a digital.

Introduction Gate-level minimization refers to the design task of finding an optimal gate-level implementation of Boolean functions describing a digital.

© 2018 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google

Download ppt on pulse code modulation transmitter Ppt on nitrogen cycle and nitrogen fixation formula Ppt on duty roster samples Ppt on my school days Ppt on water activity table Ppt on symmetry of functions Ppt on bluetooth communication module Ppt on time management in classroom Ppt on brushless dc motor Ppt on optical packet switching network