Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand...
-
Upload
melissa-mccall -
Category
Documents
-
view
236 -
download
1
Transcript of Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand...
![Page 1: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/1.jpg)
Chapter 3Gate-Level Minimization
![Page 2: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/2.jpg)
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
![Page 3: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/3.jpg)
3.2 The Map Method
• Karnaugh map (K-map)– Pictorial form of a truth table– To present a visual diagram of a function ex
pressed in standard form
![Page 4: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/4.jpg)
Two-variable Map
![Page 5: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/5.jpg)
Example: f(x,y) = m1+m2+m3 = x’y+xy’+xy = x + y
![Page 6: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/6.jpg)
Three-variable Map
![Page 7: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/7.jpg)
Example 3-1
![Page 8: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/8.jpg)
Example 3-2
![Page 9: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/9.jpg)
Example 3-3
![Page 10: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/10.jpg)
Example 3-4
![Page 11: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/11.jpg)
3.3 Four-Variable Map
![Page 12: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/12.jpg)
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
![Page 13: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/13.jpg)
Example 3-5
![Page 14: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/14.jpg)
Example 3-6
![Page 15: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/15.jpg)
PI and EPI
• A prime implicant(PI)– 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.
![Page 16: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/16.jpg)
Example F(A,B,C,D) =(0,2,3,5,7,8,9,10,13,15)
![Page 17: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/17.jpg)
3.4 Five-Variable Map
![Page 18: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/18.jpg)
Relationship between Squares and Literals
![Page 19: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/19.jpg)
Example 3-7
![Page 20: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/20.jpg)
3.5 Product of Sums Simplification
• Get F’ by 0’s• Apply DeMorgan’s theorem to F’
![Page 21: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/21.jpg)
Example 3-8 Simplify the following Function into SOP
and POSF(A,B,C,D)= (0,1,2,5,8,9,10)
![Page 22: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/22.jpg)
Example 3-8 (con’t)
• F = B’D’+B’C’+A’C’D’• F’ = AB + CD + BD’ F = (AB + CD + BD’)’ = (AB)’(CD)’(BD’)’ = (A’+B’)(C’+D’)(B’+D)
![Page 23: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/23.jpg)
Implementation of Example 3-8
![Page 24: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/24.jpg)
How to express the Table 3-2
![Page 25: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/25.jpg)
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)
![Page 26: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/26.jpg)
Map for the Function of Table 3-2
• F= x’z+xz’
• F’=xz+x’z’ F=(x’+z’)(x+z)
![Page 27: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/27.jpg)
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.
![Page 28: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/28.jpg)
Example 3-9
![Page 29: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/29.jpg)
3.7 NAND and NOR Implementation
• The NAND or the NOR gate – Universal gate– Basic gates of used in all IC digital
families
![Page 30: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/30.jpg)
Why is the NAND Gate Universal?
![Page 31: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/31.jpg)
Two Graphic Symbols for NAND Gate
![Page 32: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/32.jpg)
Two-Level Implementation
![Page 33: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/33.jpg)
Example 3-10
![Page 34: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/34.jpg)
Multilevel NAND Circuits
![Page 35: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/35.jpg)
Implementation of F=(AB’+A’B)(C+D’)
![Page 36: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/36.jpg)
Why is the NOR Gate Universal?
![Page 37: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/37.jpg)
Two Graphic Symbols for NOR Gate
![Page 38: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/38.jpg)
![Page 39: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/39.jpg)
![Page 40: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/40.jpg)
3.8 Other Two-Level Implementation
• Wired-AND logic• Wired-OR logic
![Page 41: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/41.jpg)
AND-OR-INVERT
![Page 42: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/42.jpg)
OR-AND-INVERT
![Page 43: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/43.jpg)
Tabular Summary
![Page 44: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/44.jpg)
Example 3-11
![Page 45: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/45.jpg)
3.9 Exclusive-OR Function
• x y = xy’+x’y• (x y)’ =xy+x’y’• x 0 = x x 1 = x’• x x = 0 x x’ = 1• x y’ = x’ y = (x y)’ • A B = B A• (A B) C = A (B C) = A B C
![Page 46: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/46.jpg)
XOR Implementation
![Page 47: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/47.jpg)
Map for a 3-Input Odd function and Even function
![Page 48: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/48.jpg)
3-Input Odd and Even Functions
![Page 49: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/49.jpg)
Map for a 4-Input Odd function and Even function
![Page 50: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/50.jpg)
Even Parity Generator
![Page 51: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/51.jpg)
Even Parity Checker
![Page 52: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/52.jpg)
Logic Diagram of a Parity Generator and Checker
![Page 53: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/53.jpg)
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
![Page 54: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/54.jpg)
Two Standard HDLs Supported by IEEE
• VHDL• Verilog HDL : is chosen for this book
![Page 55: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/55.jpg)
Verilog HDL
• module endmodule• // : comment notation• input output• wire• and or not • # time unit• `timescale: compiler directive
![Page 56: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/56.jpg)
![Page 57: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/57.jpg)
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
![Page 58: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/58.jpg)
![Page 59: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/59.jpg)
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
![Page 60: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/60.jpg)
![Page 61: Chapter 3 Gate-Level Minimization. 3.1 Introduction The purposes of this chapter –To understand the underlying mathematical description and solution of.](https://reader034.fdocuments.in/reader034/viewer/2022050816/5513fdfd550346e2488b4764/html5/thumbnails/61.jpg)
User-Defined Primitives
• primitive endprimitive• table endtable• HDL Example 3-5