HW 1 Solutions ECE 465, Fall 13. Shantanu Dutt UIC
|
|
- Letitia Stafford
- 5 years ago
- Views:
Transcription
1 HW 1 Solutions ECE 465, Fall 13 Shantanu Dutt UIC
2 Question 1. (a) Prove that a necessary condition for two minterms to be logically adjacent is for the difference in their numerical values to be a power of 2, i.e., 2 i for some i >= 0. (20) (b) The above condition is, however, not sufficient, i.e., if the above condition is true, it will not always the case that the two minterms will be logically adjacent. Provide a generic situation of bit patterns in a minterm m k such that the minterm m j = m k + 2 i is not logically adjacent to m k, and show how this comes about. (20) Soln. 1a) Let 2 MTs u, v be logically adjacent, and let them differ in bit i. Then without loss of generality, if u(i) = 0, then v(i) = 1. Since all their other bits are the same v = u + 2 i. Thus logical adjacency between u, v a difference of some 2 i between u, v. 1b) Let MT u have a maximal sequence of 1 s (surrounded by 0 s) in m+1 bits, say, in i th to (i+m) th bits, where m >= 0. So u = u n-1 u n-2 u i+m u i-2. u 0, where the u j s can be 1 or 0. Let v = u + 2 i. Then v = u n-1 u n-2 u i+m u i-1. u u n-1 u n-2 u i+m u i-1. u 0 which differs from u in bits i to i+m+1 (m+2) bits >= 2 bits. Thus v is not logically adjacent to u. Thus a difference of some 2 i between two MTs u, v does not guarantee that they will be logically adjacent.
3 Question 2. In class we proved that optimality of the good row covering rule in which the covering row (PI) has cost less than or equal to the cost of the covered row (PI). For the column covering rule, prove that: a) It is correct, i.e., after a covering column m j is deleted, any final SOP expression determined using QM will automatically cover m j. (10) b) It is optimal, i.e., deleting a covering column mj does not lead to a final SOP expression determined using QM that can have cost greater than an expression determined using QM if m j is not deleted. (40) Soln. 2a) Let col/mt m j covers col/mt m i. Since m i must be covered in the final solution, one of the PIs that cover m i (PI k or PI q ) must be in the final solution. Since any PI that covers m i also covers m j, m j is automatically covered in the final solution. m i m j Therefore, m j can be excl. deleted from PIT/RPIT. PI k x x 2b) Let col/mt m j cover col/mt m i as shown in the PIT on the right. Let PI(m j /m i ) be the set of PIs that cover m j but not m i. If m j is deleted, PI r x then sub-optimality in the selection of PIs can only come about if the PI q x x PIs in PI(m j /m i ) are incorrectly exclusion deleted due to deleting m j. PI A PI, say, PIr in PI(mj/mi) can be excl. deleted due to the deletion of mj t x if and only if it only covers mj in the current PIT/RPIT. Thus at the current stage of the PIT/RPIT to include PI r in the final expression, it will only be to cover m j. However, it is necessary to include a PI (say, PI k ) that covers m i in the final solution, and PI k also covers m j (by definition of col. covering). Thus it is unnecessary and incurs more cost to also include a PI in PI(m j /m i ) for the purpose of only covering m j. Thus, since a PI in PI(m j /m i ) that is excl. deleted due to deleting m j only covers MT m j at the current stage of the PIT/RPIT, their exclusion deletion cannot result in a final SOP expression that has more cost than the SOP expression that would result if such a PI were not exclusion deleted. Thus deleting a covering col. m j cannot result in a final SOP expression that has more cost than the SOP expression that would result if m j were not deleted. QED
4 3. (a) One of the sources of sub-optimality of QM is the use of heuristics to choose a PI to break a cyclic PIT or RPIT. Devise a simple method that is optimal in the case of a cyclic PIT or RPIT (state the method clearly in words; a pseudo-code of the type given for QM in the notes is not needed, though you can give one if you think it will be more explanatory). 40 (b) In a 2-level logic minimization problem in which a cyclic PIT or RPIT is encountered only once, what will be the time-complexity of your method in O notation (discussed in the notes). 20 Soln. 3: Let QMc be the desired algorithm, which applies the cycle tackling technique given below for a cyclic pit/rpit, and uses normal QM for a non-cyclic pit/rpt. Various possible solutions: i. Naïve method: Let p be the # of PIs in the cyclic pit/rpit: Select (inclusion delete) each PI PIj in turn, solve the corresponding rpit recursively using QMc, and determine the cost of the final soln fj. Select the least expensive of all solutions fj. Proof of Optimality: There are exactly p ways of breaking the cyclic pit/rpit, and all these ways are explored. Thus, since all cases at the current decision point (of how to break the cyclic pit/rpit) are considered, and the min-cost one chosen, the resulting solution is optimal for breaking the cyclic pit/rpit. Worst-case complexity for 1 cyclic pit/rpit occurrence: p*(complexity of QM) = O(max(m 3 p 2, mp 4 )) [Note: In the complexity of QM, m 2 p 2 can be removed, as for m > p, it is dominated by m 3 p, otherwise, it is dominated by mp 3 ]. ii. Choose a MT mi w/ the least # pi of PIs that cover it. For each PI PIj covering mi, select (inclusion delete) it in turn, solve the corresponding rpit recursively using QMc, and determine the cost of the final soln fj. Select the least expensive of all solutions fj. Proof of Optimality: At least one of the pi PIs covering mi have to be part of final soln., and each such PI being in the final soln. is explored, and the cyclic pit/rpit is also broken each time while doing so. Thus, since for the decision point of which PI covering mi to definitely include in the final soln. is exhaustively explored (while also breaking the cyclic pit/rpit at the same time), and the min-cost solution is chosen, this also leads to the optimal solution for breaking the cyclic pit/rpit. Worst-case complexity for 1 cyclic pit/rpit occurrence: = pi*(complexity of QM). Since pi = O(p), complexity = O(max(m 3 p 2, mp 4 )). However, since on the average pi will be much lower than O(p), the average complexity of this technique will be much lower (and also much lower than that of the above naïve method). iii. Select (inclusion delete) any single PI, PIj solve the corresponding rpit recursively using QMc, and determine the cost of the final soln fj. Follow this by exclusion deletion of PIj, solve the corresponding rpit recursively using QMc, and determine the cost of the final soln fj. Select the least expensive of the two solutions fj, fj. Possible issue w/ this approach: see next slide.
5 iii. (contd.) Possible issue w/ this approach: It may not break the cycle when PIj is exclusion deleted since no MTs are deleted in the process. This is shown the the figure below. 2-mt PIs 2 X s PIj 2 X s 4-mt/X PIs PIk Fig.: Exclusion deletion of either PIj or PIk does not break the cycle However, repeated application of this technique will ultimately break the cycle. E.g., in the figure above, excl. deletion of PIj does not break the cycle, but this followed by either inclusion or excl. deletion of any other PI breaks the cycle. Proof of Optimality: The decision point of whether a PI should be in the final solution or not, is exhaustively explored by the 2 cases of it should or should not be included, and the best solution chosen. Thus the best solution found is optimal. Note that even if the cyclic pit/rpit is not broken w/ an exclusion deletion of a PI, the solution path from this choice is explored further until the cyclic break occurs, and so a solution will be found for the exclusion-deletion choice. Worst-Case complexity for 1 cyclic pit/rpit occurrence: If there are k PIs covering, say a group of exactly 2 MTs involved in a cycle (k=2 in the above figure), then we have k decision points in the worst-case focusing only on these PIs, and each decision point involves 2 choices. The complexity is thus 2k*(complexity of QM) = O(max(km 3 p, kmp 3 )). We have seen that in the worst case the # of PIs covering a MT can be O(2 n-1 ), and thus k is also O(2 n-1 ). However, on the average, k is probably a constant.
6 iv. Form PI pairs that extend the coverage of each of their constituent PIs (i.e., if a pair is covered any of its constituent PI, do not form it), and see if good covering exists between pairs or pair to singles (the latter will be rare). If so apply the covering, i.e., exclusion delete the PIs of the good-covered pairs that are not in the good covering pairs, go back to the RPIT w/ only single PIs (the remaining ones), and apply QMc to it. If no good covering exists, form PI triples that extend the coverage of each constituent PI pair in it, and check for good coverings among triples, triples to pairs and triples to singles. If so, apply all of them (exclusion delete all single PIs in the good-covered sets of PIs that are not in the goodcovering ones), go back to the RPIT w/ only single PIs (the remaining ones), and apply QMc to it. If no good coverings found here form the next larger set of PIs that extend the coverage of their previous smaller constituent sets, and again look for good coverings between them or from them to all smaller set of PIs, and so on until good coverings are found (in the worst-case if even (p-1)-set PIs do not good cover any other set all p PIs are needed in the expression (it can probably be proven this will be the case only if at least one is an EPI, and we are assuming that this is a cyclic pit/rpit, so there are no EPIs, and thus the worst-case will be forming up to (p-1)-set PIs (we are guaranteed to find good coverings at this point). Proof of Optimality: If a good covering is found, it breaks the cycle and, as we have seen good covering is optimal (the optimality proof and thus result for single-pi coverings that we have seen hold in the case of multiple-pi coverings as well). If no good-covering is found for PI sets of size i, we try sets of size i+1, until we get to set sizes of size p-1. Since at most p-1 PIs will be needed in the final expression as stated above, and we will reach this point only if the optimal solution has p-1 PIs (otherwise if the optimal solution has k < p-1 PIs, then we would have found a good covering earlier in our process of set sizes of <= k), we will find a good covering of the set of p-1 PIs of the optimal solution covering all other (p-1)-size sets. Thus the process will terminate with finding at least one good covering, which will be optimal and also break the cycle. p 1 Worst-case complexity for 1 cyclic pit/rpit occurrence O( m pci [ pci i 1 i=2 + (pcj)] + Complexity of QM) 2 j=1 where m = # of MTs. This complexity expression is due the checking for good covering that has to be done for i-size PI sets between themselves and between them and smaller PI sets. The first term is dominated by m*(pcp/2)*[(pcp/2)/2 + p 2 1 pcj] j=1 ~ Q(m*2 p-1 *2 p-1 ) = Q(m*2 2p ), which dominates each of the other terms. However, there are p-3 other terms, i.e., not just a constant # of terms, but a # of terms that is a function of size parameter p. The max. value of the inner summation is p 2 j=1 pcj = O(2 p p 1 ). Thus m pci [ pci i 1 p 1 i=2 + (pcj)] 2 j=1 < m pci [ pcp i=2 + 2^p] ~ 2 p 1 m (pci) [3 2 p_ 1 i=2 ] < 3*2 p-1 *m*2 p = 3*2 2p-1 = Q(m*2 2p ), which is the same order as that of the max subterm of the 1 st term of the above complexity expression. Thus this 1 st term is Q(m*2 2p ), and since this dominates the basic QM complexity, and since the outer notation is big O, we have the complexity as O(m*2 2p ) (note that if we could have proved that there is a problem instance for which (p-1)-size subsets of PIs will need to be formed in the above technique, then we could have said that the complexity is Q(m*2 2p ) ). As can be seen this is exponential in p, while QM is polynomial in p.
7 Question 4) Suppose we pick PI2*PI3*PI5*PI7. The corresponding final solution of the original function is: f = PI2 + PI3 + PI5 + PI7, f (A, B, C, D) = A B D + B C D + A CD + BCD
8 Suppose we pick PI1*PI4*PI6*PI8. The corresponding final solution of the original function is: f = PI1 + PI4 + PI6 + PI8, f (A, B, C, D) = A B D + A BC + AB C + BCD
9 Question 5)
10
HW 1 Solutions ECE 465, F 13. Shantanu Dutt UIC
HW 1 Solutions ECE 465, F 13 Shantanu Dutt UIC 1. (a) Prove that a necessary condition for two minterms to be logically adjacent is for the difference in their numerical values to be a power of 2, i.e.,
More informationECE 465, Fall 2013 Homework 3
ECE 465, Fall 2013 Homework 3 1) Prob. 5.2(b) (PLA design) from the text. For this PLA design, you need design a primarily hardwarecost minimal design using the multi-function QM method using a PI cost
More informationLogic Synthesis and Verification
Logic Synthesis and Verification Jie-Hong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall 24 Two-Level Logic Minimization (/2) Reading: Logic Synthesis in a Nutshell
More informationSimplification of Boolean Functions. Dept. of CSE, IEM, Kolkata
Simplification of Boolean Functions Dept. of CSE, IEM, Kolkata 1 Simplification of Boolean Functions: An implementation of a Boolean Function requires the use of logic gates. A smaller number of gates,
More informationLecture 13: Dynamic Programming Part 2 10:00 AM, Feb 23, 2018
CS18 Integrated Introduction to Computer Science Fisler, Nelson Lecture 13: Dynamic Programming Part 2 10:00 AM, Feb 23, 2018 Contents 1 Holidays 1 1.1 Halloween..........................................
More informationSynthesis of 2-level Logic Exact and Heuristic Methods. Two Approaches
Synthesis of 2-level Logic Exact and Heuristic Methods Lecture 7: Branch & Bound Exact Two Approaches Find all primes Find a complete sum Find a minimum cover (covering problem) Heuristic Take an initial
More informationChapter 2. Reductions and NP. 2.1 Reductions Continued The Satisfiability Problem (SAT) SAT 3SAT. CS 573: Algorithms, Fall 2013 August 29, 2013
Chapter 2 Reductions and NP CS 573: Algorithms, Fall 2013 August 29, 2013 2.1 Reductions Continued 2.1.1 The Satisfiability Problem SAT 2.1.1.1 Propositional Formulas Definition 2.1.1. Consider a set of
More informationL6: Two-level minimization. Reading material
L6: Two-level minimization Reading material de Micheli pp. 269-343 p. 2 - Advanced Logic Design L6 - Elena Dubrova Formulation of the two-level minimization problem input: a Boolean function f(x,x 2,...,x
More informationFundamental Algorithms for System Modeling, Analysis, and Optimization
Fundamental Algorithms for System Modeling, Analysis, and Optimization Edward A. Lee, Jaijeet Roychowdhury, Sanjit A. Seshia UC Berkeley EECS 244 Fall 2016 Lecturer: Yu-Yun Dai Copyright 2010-date, E.
More informationConfigurational Analysis beyond the Quine-McCluskeyMilan, algorithm 8 February / 29
Configurational Analysis beyond the Quine-McCluskey algorithm Adrian Dușa University of Bucharest Milan, 8 February 2018 Configurational Analysis beyond the Quine-McCluskeyMilan, algorithm 8 February 2018
More informationMore Approximation Algorithms
CS 473: Algorithms, Spring 2018 More Approximation Algorithms Lecture 25 April 26, 2018 Most slides are courtesy Prof. Chekuri Ruta (UIUC) CS473 1 Spring 2018 1 / 28 Formal definition of approximation
More informationMC9211 Computer Organization
MC92 Computer Organization Unit : Digital Fundamentals Lesson2 : Boolean Algebra and Simplification (KSB) (MCA) (29-2/ODD) (29 - / A&B) Coverage Lesson2 Introduces the basic postulates of Boolean Algebra
More informationLogic Minimization. Two-Level. University of California. Prof. Srinivas Devadas. Prof. Richard Newton Prof. Sanjit Seshia. Prof.
Two-Level Logic Minimization Prof. Srinivas Devadas MIT Prof. Kurt Keutzer Prof. Richard Newton Prof. Sanjit Seshia University of California Berkeley, CA 1 Topics Motivation Boolean functions & notation
More informationSoftware Testing Lecture 5. Justin Pearson
Software Testing Lecture 5 Justin Pearson 2017 1 / 34 Covering Logical Expressions Logic expression show up in many situations Covering logical expressions have a long history, many are the covering criteria
More informationPart 1: Digital Logic and Gates. Analog vs. Digital waveforms. The digital advantage. In real life...
Part 1: Digital Logic and Gates Analog vs Digital waveforms An analog signal assumes a continuous range of values: v(t) ANALOG A digital signal assumes discrete (isolated, separate) values Usually there
More informationDynamic Programming. Cormen et. al. IV 15
Dynamic Programming Cormen et. al. IV 5 Dynamic Programming Applications Areas. Bioinformatics. Control theory. Operations research. Some famous dynamic programming algorithms. Unix diff for comparing
More informationEquivalence Checking of Sequential Circuits
Equivalence Checking of Sequential Circuits Sanjit Seshia EECS UC Berkeley With thanks to K. Keutzer, R. Rutenbar 1 Today s Lecture What we know: How to check two combinational circuits for equivalence
More informationThe Karnaugh Map COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals
The Karnaugh Map COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals Presentation Outline Boolean Function Minimization The Karnaugh Map (K-Map) Two, Three,
More information20. Dynamic Programming II
Quiz Solution 20. Dynamic Programming II Subset sum problem, knapsack problem, greedy algorithm vs dynamic programming [Ottman/Widmayer, Kap. 7.2, 7.3, 5.7, Cormen et al, Kap. 15,35.5] n n Table Entry
More informationThe simplex algorithm
The simplex algorithm The simplex algorithm is the classical method for solving linear programs. Its running time is not polynomial in the worst case. It does yield insight into linear programs, however,
More informationProbability of Compound Events. Shantanu Dutt ECE Dept. Uinv. of Illinois at Chicago
Probability of Compound Events Shantanu Dutt ECE Dept. inv. of Illinois at Chicago A I B Basics Mutually Exclusive Events p(a) will denote prob. of event A. Two events A, B are mutually exclusive (ME)
More information9.1. Unit 9. Implementing Combinational Functions with Karnaugh Maps or Memories
. Unit Implementing Combinational Functions with Karnaugh Maps or Memories . Outcomes I can use Karnaugh maps to synthesize combinational functions with several outputs I can determine the appropriate
More informationUNIT 5 KARNAUGH MAPS Spring 2011
UNIT 5 KRNUGH MPS Spring 2 Karnaugh Maps 2 Contents Minimum forms of switching functions Two- and three-variable Four-variable Determination of minimum expressions using essential prime implicants Five-variable
More informationELEC Digital Logic Circuits Fall 2014 Logic Minimization (Chapter 3)
ELE 2200-002 Digital Logic ircuits Fall 204 Logic Minimization (hapter 3) Vishwani D. grawal James J. Danaher Professor Department of Electrical and omputer Engineering uburn University, uburn, L 36849
More informationOptimizations and Tradeoffs. Combinational Logic Optimization
Optimizations and Tradeoffs Combinational Logic Optimization Optimization & Tradeoffs Up to this point, we haven t really considered how to optimize our designs. Optimization is the process of transforming
More informationIE418 Integer Programming
IE418: Integer Programming Department of Industrial and Systems Engineering Lehigh University 2nd February 2005 Boring Stuff Extra Linux Class: 8AM 11AM, Wednesday February 9. Room??? Accounts and Passwords
More informationInformation Science 2
Information Science 2 Probability Theory: An Overview Week 12 College of Information Science and Engineering Ritsumeikan University Agenda Terms and concepts from Week 11 Basic concepts of probability
More informationComputational complexity
COMS11700 Computational complexity Department of Computer Science, University of Bristol Bristol, UK 2 May 2014 COMS11700: Computational complexity Slide 1/23 Introduction If we can prove that a language
More informationELC224C. Karnaugh Maps
KARNAUGH MAPS Function Simplification Algebraic Simplification Half Adder Introduction to K-maps How to use K-maps Converting to Minterms Form Prime Implicants and Essential Prime Implicants Example on
More informationKarnaugh Map & Boolean Expression Simplification
Karnaugh Map & Boolean Expression Simplification Mapping a Standard POS Expression For a Standard POS expression, a 0 is placed in the cell corresponding to the product term (maxterm) present in the expression.
More informationSAT, NP, NP-Completeness
CS 473: Algorithms, Spring 2018 SAT, NP, NP-Completeness Lecture 22 April 13, 2018 Most slides are courtesy Prof. Chekuri Ruta (UIUC) CS473 1 Spring 2018 1 / 57 Part I Reductions Continued Ruta (UIUC)
More informationCOM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 1 of 12
COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 6 -- page 1 of 12 Karnaugh Maps In this lecture, we will discuss Karnaugh maps (K-maps) more formally than last time and discuss a more
More informationMinimization techniques
Pune Vidyarthi Griha s COLLEGE OF ENGINEERING, NSIK - 4 Minimization techniques By Prof. nand N. Gharu ssistant Professor Computer Department Combinational Logic Circuits Introduction Standard representation
More informationQuine-McCluskey (Tabular) Minimization
Quine-McCluskey (Tabular) Minimization Two step process utilizing tabular listings to: Identify prime implicants (implicant tables) Identify minimal PI set (cover tables) All work is done in tabular form
More informationAnand Raghunathan MSEE 348
ECE 595Z: Digital VLSI Design Automation, Spring 2012 2012 Anand Raghunathan 1 ECE 595Z Digital Systems Design Automation Module 2 (Lectures 3-5) : Advanced Boolean Algebra Lecture 5 Anand Raghunathan
More informationPengju XJTU 2016
Introduction to AI Chapter13 Uncertainty Pengju Ren@IAIR Outline Uncertainty Probability Syntax and Semantics Inference Independence and Bayes Rule Wumpus World Environment Squares adjacent to wumpus are
More informationDynamic Programming( Weighted Interval Scheduling)
Dynamic Programming( Weighted Interval Scheduling) 17 November, 2016 Dynamic Programming 1 Dynamic programming algorithms are used for optimization (for example, finding the shortest path between two points,
More informationESE535: Electronic Design Automation. Today. Problem. EDA Use PLA. Programmable Array Logic (PLAs) Two-Level Logic Optimization
ESE535: Electronic Design Automation Today Day 4: February 25, 2009 Two-Level Logic-Synthesis Two-Level Logic Optimization Problem Definitions Basic Algorithm: Quine-McClusky Improvements 1 2 Problem EDA
More informationCHAPTER 7. Solutions for Exercises
CHAPTER 7 Solutions for Exercises E7.1 (a) For the whole part we have: Quotient Remainders 23/2 11 1 11/2 5 1 5/2 2 1 2/2 1 0 1/2 0 1 Reading the remainders in reverse order we obtain: 23 10 = 10111 2
More informationChapter 4 Optimized Implementation of Logic Functions
Chapter 4 Optimized Implementation of Logic Functions Logic Minimization Karnaugh Maps Systematic Approach for Logic Minimization Minimization of Incompletely Specified Functions Tabular Method for Minimization
More informationLecture 7: Karnaugh Map, Don t Cares
EE210: Switching Systems Lecture 7: Karnaugh Map, Don t Cares Prof. YingLi Tian Feb. 28, 2019 Department of Electrical Engineering The City College of New York The City University of New York (CUNY) 1
More informationCS 6901 (Applied Algorithms) Lecture 3
CS 6901 (Applied Algorithms) Lecture 3 Antonina Kolokolova September 16, 2014 1 Representative problems: brief overview In this lecture we will look at several problems which, although look somewhat similar
More informationfor Digital Systems Simplification of logic functions Tajana Simunic Rosing Sources: TSR, Katz, Boriello & Vahid
SE140: omponents and Design Techniques for Digital Systems Simplification of logic functions Tajana Simunic Rosing 1 What we covered thus far: Number representations Where we are now inary, Octal, Hex,
More informationOptimization and Complexity
Optimization and Complexity Decision Systems Group Brigham and Women s Hospital, Harvard Medical School Harvard-MIT Division of Health Sciences and Technology Aim Give you an intuition of what is meant
More informationUNIT 4 MINTERM AND MAXTERM EXPANSIONS
UNIT 4 MINTERM AND MAXTERM EXPANSIONS Spring 2 Minterm and Maxterm Expansions 2 Contents Conversion of English sentences to Boolean equations Combinational logic design using a truth table Minterm and
More informationSlides for Lecture 16
Slides for Lecture 6 ENEL 353: Digital Circuits Fall 203 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 6 October, 203 ENEL 353 F3 Section
More informationUnit 2 Session - 6 Combinational Logic Circuits
Objectives Unit 2 Session - 6 Combinational Logic Circuits Draw 3- variable and 4- variable Karnaugh maps and use them to simplify Boolean expressions Understand don t Care Conditions Use the Product-of-Sums
More informationCS221: Digital Design. Dr. A. Sahu. Indian Institute of Technology Guwahati
CS221: Digital Design QMLogicMinimization Minimization Dr. A. Sahu DeptofComp.Sc.&Engg. Indian Institute of Technology Guwahati 1 Outline Quine McCluskey(QM) Logic Minimization Examples Writing C/C++ program
More informationPart V. Intractable Problems
Part V Intractable Problems 507 Chapter 16 N P-Completeness Up to now, we have focused on developing efficient algorithms for solving problems. The word efficient is somewhat subjective, and the degree
More informationCS 241 Analysis of Algorithms
CS 241 Analysis of Algorithms Professor Eric Aaron Lecture T Th 9:00am Lecture Meeting Location: OLB 205 Business Grading updates: HW5 back today HW7 due Dec. 10 Reading: Ch. 22.1-22.3, Ch. 25.1-2, Ch.
More information15-780: LinearProgramming
15-780: LinearProgramming J. Zico Kolter February 1-3, 2016 1 Outline Introduction Some linear algebra review Linear programming Simplex algorithm Duality and dual simplex 2 Outline Introduction Some linear
More informationChapter 3 Deterministic planning
Chapter 3 Deterministic planning In this chapter we describe a number of algorithms for solving the historically most important and most basic type of planning problem. Two rather strong simplifying assumptions
More informationGraph Theorizing Peg Solitaire. D. Paul Hoilman East Tennessee State University
Graph Theorizing Peg Solitaire D. Paul Hoilman East Tennessee State University December 7, 00 Contents INTRODUCTION SIMPLE SOLVING CONCEPTS 5 IMPROVED SOLVING 7 4 RELATED GAMES 5 5 PROGENATION OF SOLVABLE
More informationSpiral 1 / Unit 5. Karnaugh Maps
-. Spiral / Unit Karnaugh Maps -. Outcomes I know the difference between combinational and sequential logic and can name examples of each. I understand latency, throughput, and at least technique to improve
More informationT02 Tutorial Slides for Week 6
T02 Tutorial Slides for Week 6 ENEL 353: Digital Circuits Fall 2017 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 17 October, 2017
More informationCS 310 Advanced Data Structures and Algorithms
CS 310 Advanced Data Structures and Algorithms Runtime Analysis May 31, 2017 Tong Wang UMass Boston CS 310 May 31, 2017 1 / 37 Topics Weiss chapter 5 What is algorithm analysis Big O, big, big notations
More informationOperations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture - 27 Flow Shop Scheduling - Heuristics - Palmer, Campbell Dudek
More informationLecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University
Lecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University Original Source: Aby K George, ECE Department, Wayne State University Contents The Map method Two variable
More informationOutcomes. Spiral 1 / Unit 5. Logic Function Synthesis KARNAUGH MAPS. Karnaugh Maps
-. -. Spiral / Unit Mark Redekopp Outcomes I know the difference between combinational and sequential logic and can name examples of each. I understand latency, throughput, and at least technique to improve
More informationKarnaugh Maps Objectives
Karnaugh Maps Objectives For Karnaugh Maps of up to 5 variables Plot a function from algebraic, minterm or maxterm form Obtain minimum Sum of Products and Product of Sums Understand the relationship between
More informationP, NP, NP-Complete. Ruth Anderson
P, NP, NP-Complete Ruth Anderson A Few Problems: Euler Circuits Hamiltonian Circuits Intractability: P and NP NP-Complete What now? Today s Agenda 2 Try it! Which of these can you draw (trace all edges)
More informationToday s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)
Today s Lecture 2/25/10 Truth Tables Continued Introduction to Proofs (the implicational rules of inference) Announcements Homework: -- Ex 7.3 pg. 320 Part B (2-20 Even). --Read chapter 8.1 pgs. 345-361.
More information3.8 Strong valid inequalities
3.8 Strong valid inequalities By studying the problem structure, we can derive strong valid inequalities which lead to better approximations of the ideal formulation conv(x ) and hence to tighter bounds.
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Goal: To obtain the simplest implementation for a given function Optimization is a more formal
More informationELEC Digital Logic Circuits Fall 2015 Logic Minimization (Chapter 3)
ELE 2200-002 igital Logic ircuits Fall 205 Logic Minimization (hapter 3) Vishwani. grawal James J. anaher Professor epartment of Electrical and omputer Engineering uburn University, uburn, L 36849 http://www.eng.auburn.edu/~vagrawal
More informationLogical Design of Digital Systems
Lecture 4 Table of Content 1. Combinational circuit design 2. Elementary combinatorial circuits for data transmission 3. Memory structures 4. Programmable logic devices 5. Algorithmic minimization approaches
More informationConstrained and Unconstrained Optimization Prof. Adrijit Goswami Department of Mathematics Indian Institute of Technology, Kharagpur
Constrained and Unconstrained Optimization Prof. Adrijit Goswami Department of Mathematics Indian Institute of Technology, Kharagpur Lecture - 01 Introduction to Optimization Today, we will start the constrained
More informationMotivating examples Introduction to algorithms Simplex algorithm. On a particular example General algorithm. Duality An application to game theory
Instructor: Shengyu Zhang 1 LP Motivating examples Introduction to algorithms Simplex algorithm On a particular example General algorithm Duality An application to game theory 2 Example 1: profit maximization
More informationDigital Logic Design. Combinational Logic
Digital Logic Design Combinational Logic Minterms A product term is a term where literals are ANDed. Example: x y, xz, xyz, A minterm is a product term in which all variables appear exactly once, in normal
More information14:332:231 DIGITAL LOGIC DESIGN
:: DIGITAL LOGIC DESIGN Ivan Marsic, Rutgers University Electrical & Computer Engineering Fall Lecture #: Combinational Circuit Synthesis II hat if we have input variables? V = V = of Example with variables
More informationBasic Math Review for CS1340
Basic Math Review for CS1340 Dr. Mihail January 15, 2015 (Dr. Mihail) Math Review for CS1340 January 15, 2015 1 / 34 Sets Definition of a set A set is a collection of distinct objects, considered as an
More informationConjunctive Normal Form and SAT
Notes on Satisfiability-Based Problem Solving Conjunctive Normal Form and SAT David Mitchell mitchell@cs.sfu.ca October 4, 2015 These notes are a preliminary draft. Please use freely, but do not re-distribute
More informationThis lecture covers Chapter 7 of HMU: Properties of CFLs
This lecture covers Chapter 7 of HMU: Properties of CFLs Chomsky Normal Form Pumping Lemma for CFs Closure Properties of CFLs Decision Properties of CFLs Additional Reading: Chapter 7 of HMU. Chomsky Normal
More informationOptimisation and Operations Research
Optimisation and Operations Research Lecture 22: Linear Programming Revisited Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/ Lecture_notes/OORII/ School
More informationBasic Math Review for CS4830
Basic Math Review for CS4830 Dr. Mihail August 18, 2016 (Dr. Mihail) Math Review for CS4830 August 18, 2016 1 / 35 Sets Definition of a set A set is a collection of distinct objects, considered as an object
More informationGate-Level Minimization
Gate-Level Minimization Dr. Bassem A. Abdullah Computer and Systems Department Lectures Prepared by Dr.Mona Safar, Edited and Lectured by Dr.Bassem A. Abdullah Outline 1. The Map Method 2. Four-variable
More informationLecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions
EE210: Switching Systems Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions Prof. YingLi Tian Feb. 15, 2018 Department of Electrical Engineering The City College of New York The
More informationReduction of Logic Equations using Karnaugh Maps
Reduction of Logic Equations using Karnaugh Maps The design of the voting machine resulted in a final logic equation that was: z = (a*c) + (a*c) + (a*b) + (a*b*c) However, a simple examination of this
More informationDigitalteknik EIT020. Lecture 10: Karnaugh Maps
Digitalteknik EIT020 Lecture 10: Karnaugh Maps September 30, 2014 Idea of minimisation Theorem There exists a prime cover that is a minimal cover. Minimal prime cover Find all prime implicants. Find the
More informationArtificial Intelligence Chapter 7: Logical Agents
Artificial Intelligence Chapter 7: Logical Agents Michael Scherger Department of Computer Science Kent State University February 20, 2006 AI: Chapter 7: Logical Agents 1 Contents Knowledge Based Agents
More informationLogic Synthesis and Verification. Two-Level Logic Minimization (1/2) Quine-McCluskey Procedure. Complexity
Logic Synthesis an Verification Two-Level Logic Minimization (/2) Jie-Hong Rolan Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall 24 Reaing: Logic Synthesis in a Nutshell
More informationEntailment with Conditional Equality Constraints (Extended Version)
Entailment with Conditional Equality Constraints (Extended Version) Zhendong Su Alexander Aiken Report No. UCB/CSD-00-1113 October 2000 Computer Science Division (EECS) University of California Berkeley,
More informationMinimierung. Wintersemester 2018/19. Folien basierend auf Material von F. Vahid und S. Werner Vorlesender: Dr. Ing.
Minimierung Grundlagen der technischen Informatik Wintersemester 28/9 Folien basierend auf Material von F. Vahid und S. Werner Wintersemester 28/9 Review - Boolean Algebra Properties Commutative (Kommutativgesetz)
More informationComputational Complexity for Algebraists
Computational Complexity for Algebraists Ross Willard University of Waterloo, Canada January 20, 2009 Ross Willard (Waterloo) Complexity for Algebraists January 20, 2009 1 / 23 Outline First hour: Decision
More informationRECAP How to find a maximum matching?
RECAP How to find a maximum matching? First characterize maximum matchings A maximal matching cannot be enlarged by adding another edge. A maximum matching of G is one of maximum size. Example. Maximum
More informationThis form sometimes used in logic circuit, example:
Objectives: 1. Deriving of logical expression form truth tables. 2. Logical expression simplification methods: a. Algebraic manipulation. b. Karnaugh map (k-map). 1. Deriving of logical expression from
More informationThe Theory of the Simplex Method. Chapter 5: Hillier and Lieberman Chapter 5: Decision Tools for Agribusiness Dr. Hurley s AGB 328 Course
The Theory of the Simplex Method Chapter 5: Hillier and Lieberman Chapter 5: Decision Tools for Agribusiness Dr. Hurley s AGB 328 Course Terms to Know Constraint Boundary Equation, Hyperplane, Constraint
More informationEnumerate all possible assignments and take the An algorithm is a well-defined computational
EMIS 8374 [Algorithm Design and Analysis] 1 EMIS 8374 [Algorithm Design and Analysis] 2 Designing and Evaluating Algorithms A (Bad) Algorithm for the Assignment Problem Enumerate all possible assignments
More informationLecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps
EE210: Switching Systems Lecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps Prof. YingLi Tian Feb. 21/26, 2019 Department of Electrical Engineering The City College of New York
More informationCS1210 Lecture 23 March 8, 2019
CS1210 Lecture 23 March 8, 2019 HW5 due today In-discussion exams next week Optional homework assignment next week can be used to replace a score from among HW 1 3. Will be posted some time before Monday
More informationPLA Minimization for Low Power VLSI Designs
PLA Minimization for Low Power VLSI Designs Sasan Iman, Massoud Pedram Department of Electrical Engineering - Systems University of Southern California Chi-ying Tsui Department of Electrical and Electronics
More informationCOMP 355 Advanced Algorithms
COMP 355 Advanced Algorithms Algorithm Design Review: Mathematical Background 1 Polynomial Running Time Brute force. For many non-trivial problems, there is a natural brute force search algorithm that
More informationLecture 59 : Instance Compression and Succinct PCP s for NP
IITM-CS6840: Advanced Complexity Theory March 31, 2012 Lecture 59 : Instance Compression and Succinct PCP s for NP Lecturer: Sivaramakrishnan N.R. Scribe: Prashant Vasudevan 1 Introduction Classical Complexity
More informationParallel Sparse Matrix Vector Multiplication (PSC 4.3)
Parallel Sparse Matrix Vector Multiplication (PSC 4.) original slides by Rob Bisseling, Universiteit Utrecht, accompanying the textbook Parallel Scientific Computation adapted for the lecture HPC Algorithms
More informationCMPUT651: Differential Privacy
CMPUT65: Differential Privacy Homework assignment # 2 Due date: Apr. 3rd, 208 Discussion and the exchange of ideas are essential to doing academic work. For assignments in this course, you are encouraged
More informationChapter 7 Logic Circuits
Chapter 7 Logic Circuits Goal. Advantages of digital technology compared to analog technology. 2. Terminology of Digital Circuits. 3. Convert Numbers between Decimal, Binary and Other forms. 5. Binary
More informationWEEK 3.1 MORE ON KARNAUGH MAPS
WEEK 3. MORE ON KARNAUGH MAPS Don t Cares Sometimes, we might have inputs and it doesn t matter what the output is; i.e., we don t care what the output is. These situations are called don t cares. Rather
More informationMidterm1 Review. Jan 24 Armita
Midterm1 Review Jan 24 Armita Outline Boolean Algebra Axioms closure, Identity elements, complements, commutativity, distributivity theorems Associativity, Duality, De Morgan, Consensus theorem Shannon
More informationCS Algorithms and Complexity
CS 50 - Algorithms and Complexity Linear Programming, the Simplex Method, and Hard Problems Sean Anderson 2/15/18 Portland State University Table of contents 1. The Simplex Method 2. The Graph Problem
More informationQ = Set of states, IE661: Scheduling Theory (Fall 2003) Primer to Complexity Theory Satyaki Ghosh Dastidar
IE661: Scheduling Theory (Fall 2003) Primer to Complexity Theory Satyaki Ghosh Dastidar Turing Machine A Turing machine is an abstract representation of a computing device. It consists of a read/write
More information