GateLevel Minimization. BME208 Logic Circuits Yalçın İŞLER


 Darcy Atkinson
 3 years ago
 Views:
Transcription
1 GateLevel Minimization BME28 Logic Circuits Yalçın İŞLER
2 Complexity of Digital Circuits Directly related to the complexity of the algebraic expression we use to build the circuit. Truth table may lead to different implementations Question: which one to use? Optimization techniques of algebraic expressions So far, ad hoc. Need more systematic (algorithmic) way QuineMcCluskey Karnaugh (K) map technique Espresso 2
3 QuineMcCluskey Method F(x,x2,x3,x4)=S 2,4,6,8,9,,2,3,5 mi x x2 x3 x
4 QuineMcCluskey Method List List 2 List 3 mi x x2 x3 x4 mi x x2 x3 x4 mi x x2 x3 x4 2 ok 2,68,9,2, ok 2,  8,2,9, ok 4,6  Finished 6 ok 4,29 ok 8,9  ok ok 8,  2 ok 8,2  ok 3 ok 9,3  ok 5 ok 2,3  ok 3,5 
5 QuineMcCluskey Method List List 2 List 3 mi x x2 x3 x4 mi x x2 x3 x4 mi x x2 x3 x4 2,6  t2 8,9,2,3   t 2,  t3 4,6  t4 Finished 4,2  t5 8,  t6 3,5  t7
6 QuineMcCluskey Method t X X X X t2 X X t3 X X t4 X X t5 X X t6 X X t7 X X t2 X X t3 X X t4 X X F(x,x2,x3,x4)=t+t7+t3+t4 =xx3 + xx2x4 + x2 x3x4 + x x2x4 t5 t6 X X t5 is a subset of t4 t6 is a subset of t3
7 TwoVariable KMap Two variables: x and y 4 minterms: m = x y m = x y m 2 = xy m 3 = xy y x m m m 2 m 3 y x x y x y xy xy 7
8 Example: TwoVariable KMap y x F = m + m + m 2 = x y + x y + xy F = F = F = F = x + y We can do the same optimization by combining adjacent cells. 8
9 ThreeVariable KMap yz x m m m 3 m 2 m 4 m 5 m 7 m 6 Adjacent squares: they differ by only one variable, which is primed in one square and not primed in the other m 2 m 6, m 3 m 7 m 2 m, m 6 m 4 9
10 Example: ThreeVariable KMap F (x, y, z) = S (2, 3, 4, 5) yz x F (x, y, z) = F 2 (x, y, z) = S (3, 4, 6, 7) yz x F (x, y, z) =
11 Example: ThreeVariable KMap F (x, y, z) = S (2, 3, 4, 5) yz x F (x, y, z) = xy + x y F 2 (x, y, z) = S (3, 4, 6, 7) yz x F (x, y, z) = xz + yz
12 Three Variable Karnaugh Maps One square represents one minterm with three literals Two adjacent squares represent a term with two literals Four adjacent squares represent a term with one literal Eight adjacent squares produce a function that is always equal to. 2
13 F (x, y, z) = S (, 2, 4, 5, 6) Example y x yz x z F (x, y, z) = 3
14 F (x, y, z) = S (, 2, 4, 5, 6) Example y x yz x z F (x, y, z) = 4
15 Finding Sum of Minterms If a function is not expressed in sum of minterms form, it is possible to get it using Kmaps Example: F(x, y, z) = x z + x y + xy z + yz x yz F(x, y, z) = x y z + x yz + x yz + xy z + xyz F(x, y, z) = 5
16 FourVariable KMap Four variables: x, y, z, t 4 literals 6 minterms zt xy m m m 3 m 2 z x m 4 m 5 m 7 m 6 m 2 m 3 m 5 m 4 m 8 m 9 m m y t 6
17 Example: FourVariable KMap F(x,y,z,t) = S (,, 2, 4, 5, 6, 8, 9, 2, 3, 4) zt xy F(x,y,z,t) = 7
18 Example: FourVariable KMap F(x,y,z,t) = S (,, 2, 4, 5, 6, 8, 9, 2, 3, 4) zt xy F(x,y,z,t) = 8
19 Example: FourVariable KMap F(x,y,z,t) = x y z + y zt + x yzt + xy z zt xy F(x,y,z,t) = 9
20 Example: FourVariable KMap F(x,y,z,t) = x y z + y zt + x yzt + xy z zt xy F(x,y,z,t) = 2
21 Example: FourVariable KMap zt xy F(x,y,z,t) = 2
22 Prime Implicants A product term obtained by combining maximum possible number of adjacent squares in the map If a minterm is covered by only one prime implicant, that prime implicant is said to be essential. A single on the map represents a prime implicant if it is not adjacent to any other s. Two adjacent s form a prime implicant, provided that they are not within a group of four adjacent s. So on 22
23 Example: Prime Implicants F(x,y,z,t) = S (, 2, 3, 5, 7, 8, 9,,, 3, 5) zt xy Prime implicants y t essential since m is covered only in it yt  essential since m 5 is covered only in it They together cover m, m 2, m 8, m, m 5, m 7, m 3, m 5 23
24 zt Example: Prime Implicants xy m 3, m 9, m are not yet covered. How do we cover them? There are actually more than one way. 24
25 zt Example: Prime Implicants xy 3 2 Both y z and zt covers m 3 and m. m 9 can be covered in two different prime implicants: xt or xy m 3, m zt or y z m 9 xy or xt 4 25
26 Example: Prime Implicants F(x, y, z, t) = yt + y t + zt + xt or F(x, y, z, t) = yt + y t + zt + xy or F(x, y, z, t) = yt + y t + y z + xt or F(x, y, z, t) = yt + y t + y z + xy Therefore, what to do 26 Find out all the essential prime implicants Other prime implicants that covers the minterms not covered by the essential prime implicants Simplified expression is the logical sum of the essential implicants plus the other implicants
27 FiveVariable Map Downside: Karnaugh maps with more than four variables are not simple to use anymore. 5 variables 32 squares, 6 variables 64 squares Somewhat more practical way for F(x, y, z, t, w) tw yz m m m 3 m 2 m 4 m 5 m 7 m 6 m 2 m 3 m 5 m 4 m 8 m 9 m m tw yz m 6 m 7 m 9 m 8 m 2 m 2 m 23 m 22 m 28 m 29 m 3 m 3 m 24 m 25 m 27 m x = x =
28 ManyVariable Maps Adjacency: Each square in the x = map is adjacent to the corresponding square in the x = map. For example, m 4 m 2 and m 5 m 3 Use four 4variable maps to obtain 64 squares required for six variable optimization Alternative way: Use computer programs QuineMcCluskey method Espresso method 28
29 Example: FiveVariable Map F(x, y, z, t, w) = S (, 2, 4, 6, 9, 3, 2, 23, 25, 29, 3) tw yz tw yz F(x,y,z,t,w) = x = x = 3
30 Product of Sums Simplification So far simplified expressions from Karnaugh maps are in sum of products form. Simplified product of sums can also be derived from Karnaugh maps. Method: A square with actually represents a minterm Similarly an empty square (a square with ) represents a maxterm. Treat the s in the same manner as we treat s The result is a simplified expression in product of sums form. 32
31 Example: Product of Sums F(x, y, z, t) = S (,, 2, 5, 8, 9, ) Simplify this function in a. sum of products b. product of sums zt xy F(x, y, z, t) = 33
32 Example: Product of Sums F (x,y,z,t) = Apply DeMorgan s theorem (use dual theorem) F = zt xy F(x,y,z,t) = y t + y z + x z t 34 F(x,y,z,t) = (y +t)(z +t )(x +y )
33 Example: Product of Sums y t y F z x z t F(x,y,z,t) = y t + y z + x z t: sum of products implementation y t x y z F t F = (y + t)(x + y )(z + t ): product of sums implementation 35
34 Product of Maxterms If the function is originally expressed in the product of maxterms canonical form, the procedure is also valid Example: F(x, y, z) = (, 2, 5, 7) x yz 36 F(x, y, z) = F(x, y, z) = x z + xz
35 Product of Sums To enter a function F, expressed in product of sums, in the map. take its complement, F 2. Find the squares corresponding to the terms in F, 3. Fill these square with s and others with s. Example: F(x, y, z, t) = (x + y + z )(y + t) F (x, y, z, t) = zt xy 37
36 Don t Care Conditions /2 Some functions are not defined for certain input combinations Such function are referred as incompletely specified functions For instance, a circuit defined by the function has never certain input values; therefore, the corresponding output values do not have to be defined This may significantly reduces the circuit complexity 38
37 Don t Care Conditions 2/2 Example: A circuit that takes the s complement of decimal digits 39
38 Unspecified Minterms For unspecified minterms, we do not care what the value the function produces. Unspecified minterms of a function are called don t care conditions. We use X symbol to represent them in Karnaugh map. Useful for further simplification The symbol X s in the map can be taken or to make the Boolean expression even more simplified 4
39 Example: Don t Care Conditions F(x, y, z, t) = S(, 3, 7,, 5) function d(x, y, z, t) = S(, 2, 5) don t care conditions zt xy X X X F = F = F 2 = or 4
40 Example: Don t Care Conditions F = zt + x y = S(,, 2, 3, 7,, 5) F 2 = zt + x t = S(, 3, 5, 7,, 5) The two functions are algebraically unequal As far as the function F is concerned both functions are acceptable Look at the simplified product of sums expression for the same function F. zt xy X X X F = F = 42
41 Another Way to Handle KMaps  SOP x y z t F zt xy yz x t t' t t' 43
42 Another Way to Handle KMaps  SOP x y z t F zt xy yz x t + t t t' t t + t t' 44
43 Another Way to Handle KMaps  SOP x y z t F zt xy yz x t + t t t' t t + t t' 45
44 Another Way to Handle KMaps SOP x y z t F zt xy yz x t + t t t' t t + t t' 46
45 Another Way to Handle KMaps  SOP x y z t F zt xy yz x t + t t t' t t + t t' 47
46 Another Way to Handle KMaps  SOP We have s in the boxes = x+x = +x = +x Use this wherever useful If you partition = x+x then include x in one term, x in another If you use = +x, then include x in a neighboring bigger block, and process as usual 48
47 Another Way to Handle KMaps  POS x y z t F zt xy yz x t t' t. t t' t. t 49
48 Another Way to Handle KMaps  POS x y z t F zt xy yz x t t' t. t t' t. t 5
49 Another Way to Handle KMaps  POS x y z t F zt xy yz x t t' t. t t' t. t 5
50 Another Way to Handle KMaps  POS We have s in the boxes = x.x =.x =.x Use this wherever useful If you partition = x.x then include x in one term, x in another If you use =.x, then include x in a neighboring bigger block, and process as usual 52
51 Simultaneous Minimization of Multiple Boolean Functions yz x 53
52 Simultaneous Minimization of Multiple Boolean Functions yz x z x 54
53 Simultaneous Minimization of Multiple Boolean Functions yz x z x xy 55
54 Simultaneous Minimization of Multiple Boolean Functions yz x z x y z xy 56
55 Simultaneous Minimization of Multiple Boolean Functions yz x z x xy z y z xy 57
56 NAND and NOR Gates NAND and NOR gates are easier to fabricate V DD A C = (AB) B CMOS 2input AND gates requires 6 CMOS transistors 58 CMOS 3input NAND gates requires 6 CMOS transistors
57 Design with NAND or NOR Gates It is beneficial to derive conversion rules from Boolean functions given in terms of AND, OR, an NOT gates into equivalent NAND or NOR implementations x (x x) = x NOT x y [ (x y) ] = x y AND x (x y ) = x + y OR 59 y
58 x y z New Notation (xyz) x y z x + y + z ANDinvert InvertOR Implementing a Boolean function with NAND gates is easy if it is in sum of products form. Example: F(x, y, z, t) = xy + zt x y z t F(x, y, z, t) = xy + zt x y z t F(x, y, z, t) = ((xy) ) + ((zt) ) 6
59 x y z t The Conversion Method x y z t ((xy) ) + ((zt) ) = xy + zt = [ (xy) (zt) ] Example: F(x, y, z) = S(, 3, 4, 5, 7) yz x F = z + xy F = (z ) + ((xy ) ) 6
60 Example: Design with NAND Gates x y x y z F z F F = (z ) + ((xy ) ) F = z + xy Summary. Simplify the function 2. Draw a NAND gate for each product term 3. Draw a NAND gate for the OR gate in the 2 nd level, 4. A product term with single literal needs an inverter in the first level. Assume single, complemented literals are available. 62
61 MultiLevel NAND Gate Designs The standard form results in twolevel implementations Nonstandard forms may raise a difficulty Example: F = x(zt + y) + yz 4level implementation z t y x y z F 63
62 Example: Multilevel NAND F = x(zt + y) + yz z t F F 64
63 Design with MultiLevel NAND Gates Rules. Convert all AND gates to NAND gates 2. Convert all OR gates to NAND gates 3. Insert an inverter (oneinput NAND gate) at the output if the final operation is AND 4. Check the bubbles in the diagram. For every bubble along a path from input to output there must be another bubble. If not so, a. complement the input literal 65
64 Another (Harder) Example Example: F = (xy + xy)(z + t ) (threelevel implementation) x y x y F z t 66
65 Example: MultiLevel NAND Gates x y x y z t F = (xy + xy)(z + t ) G = [ (xy + xy)(z + t) ] F = (xy + xy)(z + t ) F = (xy + xy)(z + t ) 67
66 Design with NOR Gates NOR is the dual operation of NAND. All rules and procedure we used in the design with NAND gates apply here in a similar way. Function is implemented easily if it is in product of sums form. x (x + x) = x NOT x y [ (x+ y) ] = x + y OR x y (x + y ) = x y AND 68
67 Example: Design with NOR Gates F = (x+y) (z+t) w x y z t w F x y z t w F = (x + y) (z + t) w 69
68 Example: Design with NOR Gates F = (xy + zt) (z + t ) x y z t F z t 7 x y z t z t F = [((x + y) + (z + t ) ) + (z + t ) ] = ((x + y) + (z + t ) )(z + t ) = (xy + zt) (z + t )
69 Example: F = x(zt + y) + yz z t Harder Example y x y z F F 7
70 ExclusiveOR Function The symbol: x y = xy + x y (x y) = xy + x y Properties. x = x 2. x = x 3. x x = 4. x x = 5. x y = x y = (x y)  XNOR Commutative & Associative x y = y x (x y) z = x (y z) 72
71 ExclusiveOR Function XOR gate is not universal Only a limited number of Boolean functions can be expressed in terms of XOR gates XOR operation has very important application in arithmetic and errordetection circuits. Odd Function (x y) z = (xy + x y) z = (xy + x y) z + (xy + x y) z = xy z + x yz + (xy + x y ) z = xy z + x yz + xyz + x y z = S (4, 2, 7, ) 73
72 Odd Function If an odd number of variables are equal to, then the function is equal to. Therefore, multivariable XOR operation is referred as odd function. yz x Odd function yz x Even function 74
73 Odd & Even Functions x y z x y z Odd function (x y z) = ((x y) z) x y (x y z) z 75
74 Adder Circuit for Integers Addition of twobit numbers Z = X + Y X = (x x ) and Y = (y y ) Z = (z 2 z z ) Bitwise addition. z = x y (sum) c = x y (carry) 2. z = x y c c 2 = x y + x c + y c 3. z 2 = c 2 76
75 Adder Circuit z 2 = c 2 z = x y c c 2 = x y + x c + y c z = x y c = x y y x y x FA c c 2 = z 2 z z 77
76 Comparator Circuit with NAND gates F(X>Y) X = (x x ) and Y = (y y ) y y x x F(x, x, y, y ) = x y + x x y + x y y 78
77 79 Comparator Circuit  Schematic
78 8 Comparator Circuit  Simulation
GateLevel Minimization. section instructor: Ufuk Çelikcan
GateLevel Minimization section instructor: Ufuk Çelikcan Compleity of Digital Circuits Directly related to the compleity of the algebraic epression we use to build the circuit. Truth table may lead to
More informationChapter 2. Boolean Expressions:
Chapter 2 Boolean Expressions: A Boolean expression or a function is an expression which consists of binary variables joined by the Boolean connectives AND and OR along with NOT operation. Any Boolean
More informationChapter 3. GateLevel Minimization. Outlines
Chapter 3 GateLevel Minimization Introduction The Map Method FourVariable Map FiveVariable Map Outlines Product of Sums Simplification Don tcare Conditions NAND and NOR Implementation Other TwoLevel
More informationGate Level Minimization Map Method
Gate Level Minimization Map Method Complexity of hardware implementation is directly related to the complexity of the algebraic expression Truth table representation of a function is unique Algebraically
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Overview Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard
More informationGet Free notes at ModuleI One s Complement: Complement all the bits.i.e. makes all 1s as 0s and all 0s as 1s Two s Complement: One s complement+1 SIGNED BINARY NUMBERS Positive integers (including zero)
More informationCS8803: Advanced Digital Design for Embedded Hardware
CS883: Advanced Digital Design for Embedded Hardware Lecture 2: Boolean Algebra, Gate Network, and Combinational Blocks Instructor: Sung Kyu Lim (limsk@ece.gatech.edu) Website: http://users.ece.gatech.edu/limsk/course/cs883
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 3 Following the slides of Dr. Ahmed H. Madian محرم 1439 ه Winter
More informationExperiment 4 Boolean Functions Implementation
Experiment 4 Boolean Functions Implementation Introduction: Generally you will find that the basic logic functions AND, OR, NAND, NOR, and NOT are not sufficient to implement complex digital logic functions.
More information數位系統 Digital Systems 朝陽科技大學資工系. Speaker: FuwYi Yang 楊伏夷. 伏夷非征番, 道德經察政章 (Chapter 58) 伏者潛藏也道紀章 (Chapter 14) 道無形象, 視之不可見者曰夷
數位系統 Digital Systems Department of Computer Science and Information Engineering, Chaoyang University of Technology 朝陽科技大學資工系 Speaker: FuwYi Yang 楊伏夷 伏夷非征番, 道德經察政章 (Chapter 58) 伏者潛藏也道紀章 (Chapter 14) 道無形象,
More informationCombinational Logic Circuits
Chapter 3 Combinational Logic Circuits 12 Hours 24 Marks 3.1 Standard representation for logical functions Boolean expressions / logic expressions / logical functions are expressed in terms of logical
More informationKarnaugh Map (KMap) Karnaugh Map. Karnaugh Map Examples. Ch. 2.4 Ch. 2.5 Simplification using Kmap
Karnaugh Map (KMap) Ch. 2.4 Ch. 2.5 Simplification using Kmap A graphical map method to simplify Boolean function up to 6 variables A diagram made up of squares Each square represents one minterm (or
More informationDigital Design. Chapter 4. Principles Of. Simplification of Boolean Functions
Principles Of Digital Design Chapter 4 Simplification of Boolean Functions Karnaugh Maps Don t Care Conditions Technology Mapping Optimization, Conversions, Decomposing, Retiming Boolean Cubes for n =,
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 3 Following the slides of Dr. Ahmed H. Madian ذو الحجة 1438 ه Winter
More informationQUESTION BANK FOR TEST
CSCI 2121 Computer Organization and Assembly Language PRACTICE QUESTION BANK FOR TEST 1 Note: This represents a sample set. Please study all the topics from the lecture notes. Question 1. Multiple Choice
More informationChapter 2 Boolean algebra and Logic Gates
Chapter 2 Boolean algebra and Logic Gates 2. Introduction In working with logic relations in digital form, we need a set of rules for symbolic manipulation which will enable us to simplify complex expressions
More informationGateLevel Minimization
MEC520 디지털공학 GateLevel Minimization JeeHwan Ryu School of Mechanical Engineering GateLevel MinimizationThe Map Method Truth table is unique Many different algebraic expression Boolean expressions may
More informationStandard Forms of Expression. Minterms and Maxterms
Standard Forms of Expression Minterms and Maxterms Standard forms of expressions We can write expressions in many ways, but some ways are more useful than others A sum of products (SOP) expression contains:
More information1. Mark the correct statement(s)
1. Mark the correct statement(s) 1.1 A theorem in Boolean algebra: a) Can easily be proved by e.g. logic induction b) Is a logical statement that is assumed to be true, c) Can be contradicted by another
More informationChapter 2 Combinational
Computer Engineering 1 (ECE290) Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization HOANG Trang 2008 Pearson Education, Inc. Overview Part 1 Gate Circuits and Boolean Equations Binary Logic
More informationBoolean Algebra. BME208 Logic Circuits Yalçın İŞLER
Boolean Algebra BME28 Logic Circuits Yalçın İŞLER islerya@yahoo.com http://me.islerya.com 5 Boolean Algebra /2 A set of elements B There exist at least two elements x, y B s. t. x y Binary operators: +
More informationGateLevel Minimization
GateLevel Minimization ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2011 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines The Map Method
More informationSimplification of Boolean Functions
Simplification of Boolean Functions Contents: Why simplification? The Map Method Two, Three, Four and Five variable Maps. Simplification of two, three, four and five variable Boolean function by Map method.
More informationIT 201 Digital System Design Module II Notes
IT 201 Digital System Design Module II Notes BOOLEAN OPERATIONS AND EXPRESSIONS Variable, complement, and literal are terms used in Boolean algebra. A variable is a symbol used to represent a logical quantity.
More informationGateLevel Minimization
GateLevel Minimization Mano & Ciletti Chapter 3 By Suleyman TOSUN Ankara University Outline Intro to GateLevel Minimization The Map Method 2345 variable map methods ProductofSums Method Don t care
More informationUNIT II. Circuit minimization
UNIT II Circuit minimization The complexity of the digital logic gates that implement a Boolean function is directly related to the complexity of the algebraic expression from which the function is implemented.
More informationCombinational Logic & Circuits
WeekI Combinational Logic & Circuits Spring' 232  Logic Design Page Overview Binary logic operations and gates Switching algebra Algebraic Minimization Standard forms Karnaugh Map Minimization Other
More informationDigital Logic Lecture 7 Gate Level Minimization
Digital Logic Lecture 7 Gate Level Minimization By Ghada AlMashaqbeh The Hashemite University Computer Engineering Department Outline Introduction. Kmap principles. Simplification using Kmaps. Don tcare
More informationAssignment (36) Boolean Algebra and Logic Simplification  General Questions
Assignment (36) Boolean Algebra and Logic Simplification  General Questions 1. Convert the following SOP expression to an equivalent POS expression. 2. Determine the values of A, B, C, and D that make
More informationChapter 2: Combinational Systems
Uchechukwu Ofoegbu Chapter 2: Combinational Systems Temple University Adapted from Alan Marcovitz s Introduction to Logic and Computer Design Riddle Four switches can be turned on or off. One is the switch
More informationGate Level Minimization
Gate Level Minimization By Dr. M. Hebaishy Digital Logic Design Ch Simplifying Boolean Equations Example : Y = AB + AB Example 2: = B (A + A) T8 = B () T5 = B T Y = A(AB + ABC) = A (AB ( + C ) ) T8 =
More informationBoolean Algebra and Logic Gates
Boolean Algebra and Logic Gates Binary logic is used in all of today's digital computers and devices Cost of the circuits is an important factor Finding simpler and cheaper but equivalent circuits can
More informationUnitIV Boolean Algebra
UnitIV Boolean Algebra Boolean Algebra Chapter: 08 Truth table: Truth table is a table, which represents all the possible values of logical variables/statements along with all the possible results of
More informationExperiment 3: Logic Simplification
Module: Logic Design Name:... University no:.. Group no:. Lab Partner Name: Mr. Mohamed ElSaied Experiment : Logic Simplification Objective: How to implement and verify the operation of the logical functions
More informationCombinational Logic Circuits Part III Theoretical Foundations
Combinational Logic Circuits Part III Theoretical Foundations Overview Simplifying Boolean Functions Algebraic Manipulation Karnaugh Map Manipulation (simplifying functions of 2, 3, 4 variables) Systematic
More informationCombinational Logic Circuits
Chapter 2 Combinational Logic Circuits J.J. Shann (Slightly trimmed by C.P. Chung) Chapter Overview 21 Binary Logic and Gates 22 Boolean Algebra 23 Standard Forms 24 TwoLevel Circuit Optimization
More informationGateLevel Minimization
GateLevel Minimization ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2017 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines The Map Method
More informationChapter 3 Simplification of Boolean functions
3.1 Introduction Chapter 3 Simplification of Boolean functions In this chapter, we are going to discuss several methods for simplifying the Boolean function. What is the need for simplifying the Boolean
More informationCHAPTER2 STRUCTURE OF BOOLEAN FUNCTION USING GATES, KMap and QuineMcCluskey
CHAPTER2 STRUCTURE OF BOOLEAN FUNCTION USING GATES, KMap and QuineMcCluskey 2. Introduction Logic gates are connected together to produce a specified output for certain specified combinations of input
More informationLecture (05) Boolean Algebra and Logic Gates
Lecture (05) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee ١ Minterms and Maxterms consider two binary variables x and y combined with an AND operation. Since eachv ariable may appear in either
More informationPhiladelphia University Faculty of Information Technology Department of Computer Science. Computer Logic Design. By Dareen Hamoudeh.
Philadelphia University Faculty of Information Technology Department of Computer Science Computer Logic Design By Dareen Hamoudeh Dareen Hamoudeh 1 Canonical Forms (Standard Forms of Expression) Minterms
More informationUNIT4 BOOLEAN LOGIC. NOT Operator Operates on single variable. It gives the complement value of variable.
UNIT4 BOOLEAN LOGIC Boolean algebra is an algebra that deals with Boolean values((true and FALSE). Everyday we have to make logic decisions: Should I carry the book or not?, Should I watch TV or not?
More information2008 The McGrawHill Companies, Inc. All rights reserved.
28 The McGrawHill Companies, Inc. All rights reserved. 28 The McGrawHill Companies, Inc. All rights reserved. All or Nothing Gate Boolean Expression: A B = Y Truth Table (ee next slide) or AB = Y 28
More informationModule 7. Karnaugh Maps
1 Module 7 Karnaugh Maps 1. Introduction 2. Canonical and Standard forms 2.1 Minterms 2.2 Maxterms 2.3 Canonical Sum of Product or SumofMinterms (SOM) 2.4 Canonical product of sum or ProductofMaxterms(POM)
More informationIncompletely Specified Functions with Don t Cares 2Level Transformation Review Boolean Cube KarnaughMap Representation and Methods Examples
Lecture B: Logic Minimization Incompletely Specified Functions with Don t Cares 2Level Transformation Review Boolean Cube KarnaughMap Representation and Methods Examples Incompletely specified functions
More informationBinary logic. Dr.AbuArqoub
Binary logic Binary logic deals with variables like (a, b, c,, x, y) that take on two discrete values (, ) and with operations that assume logic meaning ( AND, OR, NOT) Truth table is a table of all possible
More informationSpecifying logic functions
CSE4: Components and Design Techniques for Digital Systems Specifying logic functions Instructor: Mohsen Imani Slides from: Prof.Tajana Simunic and Dr.Pietro Mercati We have seen various concepts: Last
More informationChapter 3. Boolean Algebra and Digital Logic
Chapter 3 Boolean Algebra and Digital Logic Chapter 3 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple logic circuits. Understand how
More informationNH 67, Karur Trichy Highways, Puliyur C.F, Karur District DEPARTMENT OF INFORMATION TECHNOLOGY CS 2202 DIGITAL PRINCIPLES AND SYSTEM DESIGN
NH 67, Karur Trichy Highways, Puliyur C.F, 639 114 Karur District DEPARTMENT OF INFORMATION TECHNOLOGY CS 2202 DIGITAL PRINCIPLES AND SYSTEM DESIGN UNIT 1 BOOLEAN ALGEBRA AND LOGIC GATES Review of binary
More informationMidterm Exam Review. CS 2420 :: Fall 2016 Molly O'Neil
Midterm Exam Review CS 2420 :: Fall 2016 Molly O'Neil Midterm Exam Thursday, October 20 In class, pencil & paper exam Closed book, closed notes, no cell phones or calculators, clean desk 20% of your final
More informationENGINEERS ACADEMY. 7. Given Boolean theorem. (a) A B A C B C A B A C. (b) AB AC BC AB BC. (c) AB AC BC A B A C B C.
Digital Electronics Boolean Function QUESTION BANK. The Boolean equation Y = C + C + C can be simplified to (a) (c) A (B + C) (b) AC (d) C. The Boolean equation Y = (A + B) (A + B) can be simplified to
More informationCMPE223/CMSE222 Digital Logic
CMPE223/CMSE222 Digital Logic Optimized Implementation of Logic Functions: Strategy for Minimization, Minimum ProductofSums Forms, Incompletely Specified Functions Terminology For a given term, each
More informationTWOLEVEL COMBINATIONAL LOGIC
TWOLEVEL COMBINATIONAL LOGIC OVERVIEW Canonical forms Tolevel simplification Boolean cubes Karnaugh maps QuineMcClusky (Tabulation) Method Don't care terms Canonical and Standard Forms Minterms and
More information2.1 Binary Logic and Gates
1 EED2003 Digital Design Presentation 2: Boolean Algebra Asst. Prof.Dr. Ahmet ÖZKURT Asst. Prof.Dr Hakkı T. YALAZAN Based on the Lecture Notes by Jaeyoung Choi choi@comp.ssu.ac.kr Fall 2000 2.1 Binary
More informationDIGITAL CIRCUIT LOGIC UNIT 7: MULTILEVEL GATE CIRCUITS NAND AND NOR GATES
DIGITAL CIRCUIT LOGIC UNIT 7: MULTILEVEL GATE CIRCUITS NAND AND NOR GATES 1 iclicker Question 13 Considering the KMap, f can be simplified as (2 minutes): A) f = b c + a b c B) f = ab d + a b d AB CD
More informationA B AB CD Objectives:
Objectives:. Four variables maps. 2. Simplification using prime implicants. 3. "on t care" conditions. 4. Summary.. Four variables Karnaugh maps Minterms A A m m m3 m2 A B C m4 C A B C m2 m8 C C m5 C m3
More information2.6 BOOLEAN FUNCTIONS
2.6 BOOLEAN FUNCTIONS Binary variables have two values, either 0 or 1. A Boolean function is an expression formed with binary variables, the two binary operators AND and OR, one unary operator NOT, parentheses
More informationX Y Z F=X+Y+Z
This circuit is used to obtain the compliment of a value. If X = 0, then X = 1. The truth table for NOT gate is : X X 0 1 1 0 2. OR gate : The OR gate has two or more input signals but only one output
More informationECE380 Digital Logic
ECE38 Digital Logic Optimized Implementation of Logic Functions: Strategy for Minimization, Minimum ProductofSums Forms, Incompletely Specified Functions Dr. D. J. Jackson Lecture 8 Terminology For
More informationKarnaugh Maps. Kiril Solovey. TelAviv University, Israel. April 8, Kiril Solovey (TAU) Karnaugh Maps April 8, / 22
Karnaugh Maps Kiril Solovey TelAviv University, Israel April 8, 2013 Kiril Solovey (TAU) Karnaugh Maps April 8, 2013 1 / 22 Reminder: Canonical Representation Sum of Products Function described for the
More informationSWITCHING THEORY AND LOGIC CIRCUITS
SWITCHING THEORY AND LOGIC CIRCUITS COURSE OBJECTIVES. To understand the concepts and techniques associated with the number systems and codes 2. To understand the simplification methods (Boolean algebra
More informationFinal Examination (Open Katz, asynchronous & test notes only, Calculators OK, 3 hours)
Your Name: UNIVERSITY OF CALIFORNIA AT BERKELEY BERKELEY DAVIS IRVINE LOS ANGELES RIVERSIDE SAN DIEGO SAN FRANCISCO Department of Electrical Engineering and Computer Sciences SANTA BARBARA SANTA CRUZ CS
More informationBawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University
Logic Design First Stage Lecture No.6 Boolean Algebra Bawar Abid Abdalla Assistant Lecturer Software Engineering Department Koya University Outlines Boolean Operations Laws of Boolean Algebra Rules of
More informationLiteral Cost F = BD + A B C + A C D F = BD + A B C + A BD + AB C F = (A + B)(A + D)(B + C + D )( B + C + D) L = 10
Circuit Optimization Goal: To obtain the simplest implementation for a given function Optimization is a more formal approach to simplification that is performed using a specific procedure or algorithm
More informationLecture 4: Implementation AND, OR, NOT Gates and Complement
EE210: Switching Systems Lecture 4: Implementation AND, OR, NOT Gates and Complement Prof. YingLi Tian Feb. 13, 2018 Department of Electrical Engineering The City College of New York The City University
More informationCS February 17
Discrete Mathematics CS 26 February 7 Equal Boolean Functions Two Boolean functions F and G of degree n are equal iff for all (x n,..x n ) B, F (x,..x n ) = G (x,..x n ) Example: F(x,y,z) = x(y+z), G(x,y,z)
More informationClass Subject Code Subject Prepared By Lesson Plan for Time: Lesson. No 1.CONTENT LIST: Introduction to UnitI 2. SKILLS ADDRESSED: Listening I year, 02 sem CS6201 Digital Principles & System Design S.Seedhanadevi
More informationR.M.D. ENGINEERING COLLEGE R.S.M. Nagar, Kavaraipettai
L T P C R.M.D. ENGINEERING COLLEGE R.S.M. Nagar, Kavaraipettai 601206 DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC8392 UNIT  I 3 0 0 3 OBJECTIVES: To present the Digital fundamentals, Boolean
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active in View Show
More informationCode No: R Set No. 1
Code No: R059210504 Set No. 1 II B.Tech I Semester Supplementary Examinations, February 2007 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science
More informationDigital Logic Design. Outline
Digital Logic Design GateLevel Minimization CSE32 Fall 2 Outline The Map Method 2,3,4 variable maps 5 and 6 variable maps (very briefly) Product of sums simplification Don t Care conditions NAND and NOR
More informationB.Tech II Year I Semester (R13) Regular Examinations December 2014 DIGITAL LOGIC DESIGN
B.Tech II Year I Semester () Regular Examinations December 2014 (Common to IT and CSE) (a) If 1010 2 + 10 2 = X 10, then X is  Write the first 9 decimal digits in base 3. (c) What is meant by don
More informationMenu. Algebraic Simplification  Boolean Algebra EEL3701 EEL3701. MSOP, MPOS, Simplification
Menu Minterms & Maxterms SOP & POS MSOP & MPOS Simplification using the theorems/laws/axioms Look into my... 1 Definitions (Review) Algebraic Simplification  Boolean Algebra Minterms (written as m i ):
More informationChapter 6. Logic Design Optimization Chapter 6
Chapter 6 Logic Design Optimization Chapter 6 Optimization The second part of our design process. Optimization criteria: Performance Size Power Twolevel Optimization Manipulating a function until it is
More informationCprE 281: Digital Logic
CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Minimization CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Administrative
More informationOutcomes. Unit 9. Logic Function Synthesis KARNAUGH MAPS. Implementing Combinational Functions with Karnaugh Maps
.. Outcomes Unit I can use Karnaugh maps to synthesize combinational functions with several outputs I can determine the appropriate size and contents of a memory to implement any logic function (i.e. truth
More informationDIGITAL CIRCUIT LOGIC UNIT 5: KARNAUGH MAPS (KMAPS)
DIGITAL CIRCUIT LOGIC UNIT 5: KARNAUGH MAPS (KMAPS) 1 Learning Objectives 1. Given a function (completely or incompletely specified) of three to five variables, plot it on a Karnaugh map. The function
More informationVariable, Complement, and Literal are terms used in Boolean Algebra.
We have met gate logic and combination of gates. Another way of representing gate logic is through Boolean algebra, a way of algebraically representing logic gates. You should have already covered the
More informationCode No: 07A3EC03 Set No. 1
Code No: 07A3EC03 Set No. 1 II B.Tech I Semester Regular Examinations, November 2008 SWITCHING THEORY AND LOGIC DESIGN ( Common to Electrical & Electronic Engineering, Electronics & Instrumentation Engineering,
More informationDKT 122/3 DIGITAL SYSTEM 1
Company LOGO DKT 122/3 DIGITAL SYSTEM 1 BOOLEAN ALGEBRA (PART 2) Boolean Algebra Contents Boolean Operations & Expression Laws & Rules of Boolean algebra DeMorgan s Theorems Boolean analysis of logic circuits
More informationContents. Chapter 3 Combinational Circuits Page 1 of 34
Chapter 3 Combinational Circuits Page of 34 Contents Contents... 3 Combinational Circuits... 2 3. Analysis of Combinational Circuits... 2 3.. Using a Truth Table... 2 3..2 Using a Boolean unction... 4
More informationLSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology
LSN 4 Boolean Algebra & Logic Simplification Department of Engineering Technology LSN 4 Key Terms Variable: a symbol used to represent a logic quantity Compliment: the inverse of a variable Literal: a
More informationSwitching Circuits & Logic Design
Switching Circuits & Logic Design JieHong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall 23 5 Karnaugh Maps Kmap Walks and Gray Codes http://asicdigitaldesign.wordpress.com/28/9/26/kmapswalksandgraycodes/
More informationCS470: Computer Architecture. AMD Quad Core
CS470: Computer Architecture Yashwant K. Malaiya, Professor malaiya@cs.colostate.edu AMD Quad Core 1 Architecture Layers Building blocks Gates, flipflops Functional bocks: Combinational, Sequential Instruction
More informationVALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC6302 DIGITAL ELECTRONICS
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur603 203 DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC6302 DIGITAL ELECTRONICS YEAR / SEMESTER: II / III ACADEMIC YEAR: 20152016 (ODD
More informationENEL 353: Digital Circuits Midterm Examination
NAME: SECTION: L01: Norm Bartley, ST 143 L02: Steve Norman, ST 145 When you start the test, please repeat your name and section, and add your U of C ID number at the bottom of the last page. Instructions:
More informationBOOLEAN ALGEBRA. 1. State & Verify Laws by using :
BOOLEAN ALGEBRA. State & Verify Laws by using :. State and algebraically verify Absorption Laws. (2) Absorption law states that (i) X + XY = X and (ii) X(X + Y) = X (i) X + XY = X LHS = X + XY = X( + Y)
More informationReview. EECS Components and Design Techniques for Digital Systems. Lec 05 Boolean Logic 9/404. Seq. Circuit Behavior. Outline.
Review EECS 150  Components and Design Techniques for Digital Systems Lec 05 Boolean Logic 9404 David Culler Electrical Engineering and Computer Sciences University of California, Berkeley Design flow
More information60265: Winter ANSWERS Exercise 4 Combinational Circuit Design
60265: Winter 2010 Computer Architecture I: Digital Design ANSWERS Exercise 4 Combinational Circuit Design Question 1. Onebit Comparator [ 1 mark ] Consider two 1bit inputs, A and B. If we assume that
More informationCode No: R Set No. 1
Code No: R059210504 Set No. 1 II B.Tech I Semester Regular Examinations, November 2007 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems
More informationCombinational Circuits Digital Logic (Materials taken primarily from:
Combinational Circuits Digital Logic (Materials taken primarily from: http://www.facstaff.bucknell.edu/mastascu/elessonshtml/eeindex.html http://www.cs.princeton.edu/~cos126 ) Digital Systems What is a
More informationSpring 2010 CPE231 Digital Logic Section 1 Quiz 1A. Convert the following numbers from the given base to the other three bases listed in the table:
Section 1 Quiz 1A Convert the following numbers from the given base to the other three bases listed in the table: Decimal Binary Hexadecimal 1377.140625 10101100001.001001 561.24 454.3125 111000110.0101
More informationComputer Science. Unit4: Introduction to Boolean Algebra
Unit4: Introduction to Boolean Algebra Learning Objective At the end of the chapter students will: Learn Fundamental concepts and basic laws of Boolean algebra. Learn about Boolean expression and will
More informationSwitching Theory And Logic Design UNITII GATE LEVEL MINIMIZATION
Switching Theory And Logic Design UNITII GATE LEVEL MINIMIZATION Twovariable kmap: A twovariable kmap can have 2 2 =4 possible combinations of the input variables A and B. Each of these combinations,
More informationDepartment of Electrical Engineering McGill University ECSE 221 Introduction to Computer Engineering Assignment 2 Combinational Logic
Department of Electrical Engineering McGill University ECSE 221 Introduction to Computer Engineering Assignment 2 Combinational Logic Question 1: Due October 19 th, 2009 A convenient shorthand for specifying
More informationLOGIC CIRCUITS. Kirti P_Didital Design 1
LOGIC CIRCUITS Kirti P_Didital Design 1 Introduction The digital system consists of two types of circuits, namely (i) Combinational circuits and (ii) Sequential circuit A combinational circuit consists
More informationChapter 2. Boolean Algebra and Logic Gates
Chapter 2. Boolean Algebra and Logic Gates Tong In Oh 1 Basic Definitions 2 3 2.3 Axiomatic Definition of Boolean Algebra Boolean algebra: Algebraic structure defined by a set of elements, B, together
More informationece5745planotes.txt
ece5745planotes.txt ========================================================================== Follow up on PAL/PROM/PLA Activity ==========================================================================
More informationUNCA CSCI 255 Exam 1 Spring February, This is a closed book and closed notes exam. It is to be turned in by 1:45 PM.
UNCA CSCI 255 Exam 1 Spring 2017 27 February, 2017 This is a closed book and closed notes exam. It is to be turned in by 1:45 PM. Communication with anyone other than the instructor is not allowed during
More informationReview: Standard forms of expressions
Karnaugh maps Last time we saw applications of Boolean logic to circuit design. The basic Boolean operations are AND, OR and NOT. These operations can be combined to form complex expressions, which can
More information