REPRESENTATION AND MINIMIZATION OF BOOLEAN FUNCTIONS. Part II Minimization of Boolean Functions.
|
|
- Shanon Riley
- 5 years ago
- Views:
Transcription
1 Bulletin of the Marathwada Mathematical Society Vol.5, No.1, June 2004, Pages REPRESENTATION AND MINIMIZATION OF BOOLEAN FUNCTIONS. Part II Minimization of Boolean Functions. S.R. Joshi 3, Accharya Shree Colony, Kokanwadi, Padampura Road, Aurangabad, , (M.S.), India. ABSTRACT Several methods of repersenting a given Boolean function are already discussed in Part I of this paper [1]. In this second part methods of minimizing a given Boolean function are discussed with the help of algorithms and examples. 1. INTORDUCTION One of the important applications of Boolean Algebra is the expression of circuit design problems in a form that lends it self to being more readily understood and simplified. If D 1 and D 2 are two circuit designs related to a given problem producing the same output, then we say that D 1 is simpler than D 2 if less number of input and connective devics are required in the contruction of D 1 than for D 2. The Problem of obtaining a simplest circuit design is known as a minimization problem. The importance of Boolean algebra is that it makes minimization more readily possible. The reason for this fact is that Boolean algebra is a language whose rules and permissible operations are known and are suitable for the purpose. In the begining, a person indicates a desire to have a particular circuit built related to some problem. He or she then specifies what this circuit is supposed to do. A circuit designer after further discussion with the person produces a preliminary design of the circuit to be built up, which is often a set of Boolean functions. This design is then simplified and modified in such a way that a reliable circuit that performs to specifications without waste of circuit elements is produced. The procedure of minimizing a Boolean function is discussed in
2 36 section 3 giving stress on two methods, cube array method and Karnaugh map method. 2. SOME DEFINITIONS AND ILLUSTRATIONS Definition 2.1 : Let E and F be two Boolean expressions such that E and F are equivalent and each of E and F is a sun of products. Let E contain K 1 products and F contain K 2 products. Furthur let E contain l 1 literals and F contain l 2 literals. Then E is said to be simpler than F if any of the fillowing conditions holds. (C 1 ) : K 1 < K 2 and L 1 < L 2. (C 2 ) : K 1 < K 2 and L 1 < L 2.. Example 2.1 : Let n = 4, and let a, b, c, d, be four variables. Let E = a / b / c / + a / b c / d / + a / b c / d + a b / d + a b / c / d and F = a / c / + a b / d + a b / c / d. We observe that E = F, K 1 = 5, K 2 = 3, l 1 = 18 and l 2 = 9. It is clear that F is simpler than E. Definition 2.2 : Among different equivalent Boolean experssions each being a sum of products, an experssion E is said to be minimal if no other expression simpler than E can be found. For example if E and F are the same as in example 2.1, and G = a / c / + a b / d, then it can be verified that E = F = G and that G is minimal among E,F,G. Note that for a given set of equivalent Boolean expressions there can be more than one minimal expressions. For example if we take n = 3, E 1, = ab +a / b / +bc /, E 2 =ab +a / b / + a / c /, E 3 = ab +a / b / + abc / +a / c / and E 4 = ab + a / b / + bc / + abc / are equivalent and that both E 1 and E 2 are minimal. then we observe that all these four expressions Definition 2.3 : Two products P 1 and P 2 each containing K literals (or factors) are said to be adjacent if (P 1 +P 2 ) is a product containing (K - 1) literals. For example ab / c / and abc / are adjacent because ab / c / + abc / =ac /.
3 Binary Notation and Hamming Distance : We have already considered binary notation for minterms and the concept of Hamming Distance between two minterms in the part I of this paper. [1]. We shall now illustrate these concepts for product terms, without giving formal definitions. Let n = 4 and let a,b, c, d, be four variables. Let P 1 = bcd /, P 2 = b c / d /, P 3 = ac /, P 4 = ad. To denote these products in binary notation we use 1 or 0 for each litteral according as it is uncomplemented or complimented. Further if any variable is absent in a product then that variable is denoted by x and is written at the respective position. In our example a is the first varible, b is the second varible and so on. Now for the product P 1, a is absent hence we write x in the beginning. b is uncomplimented and hence we write 1 at the second position. Similary c is replaced by 1 and d / is seplaced by 0. Thus P 1 can be expressed as P 1 = bcd / = x Similarly P 2 = b c / d / = x100, P 3 = 1x 0x, P 4 = ad = 1x x1. Note that in P 4 no variable is complimented and hence no zero occurs in P 4. Furthe b and c are absent hence x occurs at the second and third position. Here in each case x means 0 or 1.For example consider P 1. P 1 = x 110 = (1110) + (0110). = abcd / + a / bcd / = (a + a / ) ( bcd / ) = 1. ( bcd / ) = bcd / Similarly P 4 = 1 x x 1 = 1 1 x x 1 = ( ) + ( ) + ( ) i e. P 4 = abcd + abc / d + ab / cd + ab / c / d = abd + ab / d = ad. Definition 2.4 : Let P 1 and P 2 be two product terms consisting of equal number of literals experssed in binary notation such that in each of P 1 and P 2 there are equal number of x s and occur at the same position. If there is a change in m places as far as the binary digits 1 and 0 are considered then m is defined as the Humning distance between P 1 and P 2 and it is denoted by H ( P 1, P 2 ). For example if n = 4, P 1 = 1 x 00 and P 2 = 0x10 then H ( P 1, P 2 ) =2 since there is a change in two positions first and third. Similarly if P 1 = 1011 and P 2 = 1010 then H ( P 1, P 2 ) =1 since there is a change only in the fourth position. Note that if a product P is a minterm then there is no x present in it.
4 38 Definition 2.5: Two minterms P and Q are said to form a 1-cube or a line segement of order 1 if H ( P, Q) = 1. For example if n = 4, P = (0101) and Q = (0,1,1,1) thenp and Q form a 1- cube since H(P, Q) = 1. Here P and Q differ only at one place (third place ). Note that P + Q = a / bc / d + a / bcd = a / bd = 01x1. Thus P + Q is a product containing one x. Definition 2.6 : Two 1- cubes P and Q are said to form a 2-cube if P and Q have x at the same position and H ( P, Q ) =1. For example if P = 0 x10 and Q = 0 x11 then H ( P, Q ) =1, and hence P and Q form a 2-cube. Here P + Q = a / x cd / + a / xcd = a / xcx = a / c Similarly a K-cube can be defined. Definition 2.7 : a K-cube P ( k 0 ) is said to be a prime implicant for a given Boolean function f if f + P = f and there is no (K+1)-cube Q satisfying f + Q = f and P.Q = P. For example if n = 4, f = (0011) + (1101) + ( 1100) and P= 110x, we observe that f + P = f. Further it can be observed that there is no Q ( a. 2- cube) covering P and satisfying Q + f = f.. 3. METHODS OF MINIMIZATION In this section we shall discuss methods of minimizing a given Boolean function f. These methods mainly depend on an algorithm described below. At the outset we state a theorem without proof, which is used in the algorithm. Thorem 3.1 : Let P 1, P 2,...P be different prime implicants for a given Boolean m function f, then the sum P 1 + P P m is a minimal expression for f. To obtain the totality of the prime implicants for a given function f, the following algorithm is used. Algorithm 3.1 : The steps involved in the algorithm are as follows. (A 1 ) Express the given function f as a sum of minterms ( i.e.0-cubes ) and write each minterm in Binary notation. (A 2 ) Form all kinds of 1-cubes by considering pairs of minterms. If no such 1-cube can be formed call all the minterms as prime implicants. After forming 1-cubes if a minterm left is covered by any one of the 1-cubes, then delete it, otherwise call it a prime implicant. (A 3 ) Form all kinds of two cubes by considering different pairs of 1-cubes. While forming a two-cube take care that the position of x in both the 1-cubes of a pair is the same. After formation of two cubes if any of the remaining 1-cubes is such that it is covered by a 2-cube or the union of two or more
5 39 2-cubes then delete it, otherwise call it a prime implicant. ( A 4 ) Repeat step ( A 3 ) with 2 replaced by 3,4, etc. unitl formation of higher cubes is not possible. ( A 5 ) Add all prime implicants obtained in steps ( A 2 ) to ( A 4 ) and call the sum as S. ( A 6 ) S is the required minimal expression for f. There are different methods of minimizing a given Boolean function f, all of which depend on the algorithm described above. We shall discuss only two methods in this paper. ( M 1 ) Quine - McCluskey method and ( M 2 ) Karnaugh map method. ( M 1 ) Quine - McCluskey Method : In this method the concepts K-cube, Hamming distance and Prime implicant mentioned earlier are used. The main steps involved in this method are as follows: For more details see [ 1, 4 ]. ( S 1 ) Express the given Boolean function which is to be minimized as a sum of minterms each being expressed in the binary notation ( i.e. in the form of 0-cube ). If d is the decimal representation of the binary form, the correspording min-term is denoted by m d. ( S 2 ) Arrange the minterms in groups depending on the number of 1 s present in the minterms. For example if n = 4 and ( 0000 ) is present in f then it will form the first group. Similarly if the minterms (0010),(1000) and (0100) are present in f, then these three together will form the second group since each of these contains only one 1 in it. In this way groups are formed and minterms are arranged in one column according to the groups. ( S 3 ) In this step all possible 1-cubes are formed by combining two minterms in the same group. These 1-cubes are arranged in the second column. If some ninterm, can not be combined with any other minterm to form a 1-cube, call it a prime implicant. ( S 4 ) In this step all possible 2-cubes are formed by considering pairs of 1-cubes, for which x should be in the same position. If a 1-cube can not be combined with any other 1-cube to form a 2-cube, call it a prime implicant. The 2-cubes formed are arranged in the third column avoiding the repeatitions if any. ( S 5 ) Repeat step ( S 4 ) with 2 replaced by 3,4,5,...etc. to form higher order cubes and arrange them in the 4 th, 5 th etc... columns. ( S 6 ) If any prime implicant P obtained in the steps S 3 to S 5 is covered
6 by any other prime implement or their union then delete P. ( S 7 ) Add all prime implicants obtained in steps S 3 to S 5 after deleting the prime implicants considered in ( S ) and call the sum as f*. 6 ( S 8 ) f* is a minimal expression for f. We illustrate the method discussed above for a function f = b / d ( a + c ) + d / ( ac / + a / bc ) + a / b / d ( n = 4). It can be verified that f = m 1 + m 3 + m 6 + m 8 + m 9 + m 11 + m 12. Here m 9 = ( 1001) because 1001 is the binary representation of 9. We observe that there are three groups. G 1 = { ( 0001 ), ( 1000 ) } G 2 = { ( 0011 ), ( 0110 ), ( 1001 ), ( 1100 ) } G 3 = { ( 1011 ) } Following the steps ( S 3 ) to ( S 5 ) described in the method we get different prime implicants for f as indicated below. G (0001) (00 1) 1 x ( x0x1) P (1000) ( x001) 4 (0011) (100 x) P G (0110) P (1 00) (1001) (1100) ( x011) G x P3 3 (1011) (10 x1) 40 Groups 1-cubes 2-cubes 3-cubes No 3-cube is possible In this example we observe that ( after following the steps ( S 2 ) to (S 5 ) ) the prime implicants for f are P 1 = ( ), P 2 = ( x ), P 3 = ( 1 x 0 0) and P 4 = ( x o x 1 ). Further the prime implicant P 2 is covered by P 3 + P 4 because 1001 is covered by P 4 and ( ) is covered by P 3. Hence according to step ( S 6 ) P 2 can be deleted. Hence we conculude that the minimal expression for f is f* = P 1 + P 3 + P 4 = ( ) + ( 1 x 0 0 ) + ( x 0 x 1 ) = a / bcd / + ac / d / + b / d. ( M 2 ): Karnaugh Map Method : As mentioned in part I of this paper [ 1 ], a Karnaugh map is a diagram representing 2 n minterms for a given positive integer n The diagram is drawn in such a way that for each minterm a
7 41 square or a suitable area is prescribed. In general a rectangle is divided into 2 n parts known as cells, each representing a minterm. If n = 4, and the input variables are a, b, c, d then in this case there are 16 minterms ( 2 4 = 16 ), and hence in this case a rectangle is divided into 16 cells in such a way. that for each variable halving the rectangle into cells is done in four different ways ( See fig 3.1). The representation of 16 minterms can also be shown in one figure ( See fig 3.2 ). Halving by a Halving by b Halving by c Halving by d a / a / a a b / b / b / b / c / c c c / d / d / d / d / a / a / a a b / b / b / b // c / c c c / d d d d a / a / a a b b b b c / c c c / d d d d a / a / a a b b b b c / c c c / d / d / d / d / (A) (B) (C) (D) Fig.3.1 b / d / b / d bd bd / C 1 = a / c / C 2 = a / c C 3 = ac C 4 = ac / m 0 =(0000) m 1 m 10 (1000) = ( a / b / c / d / ) m 8 = ab / c / d / m 1 m 3 m 11 m 9 ( Second row represents b / d ) = R 2 = m 1 + m 3 + m 11 + m 9 m 5 m 7 m 15 = (1111) m 13 = abcd m 4 m 6 m 14 m 12 = (1100) = a / bcd / = abc / d / R 1 R 2 R 3 R 4 Fig. 3.2 Figure fig 3.1 (A) shows the nature of the first variable a whether it is in the original form or complemented form. In each of the 8 cells in the first and second column the variable a is in the complemented form. Similarly for the variables b, c and d, the halving a rectangle is shown in fig 3.1 ( B ),( C ) and ( D ) respectively. If we combine ( A ), ( B ), ( C ), and ( D ) of fig 3.1 we get figure 3.2. In this figure the form of each of the 16 minterms is indicated. For example in m 12 a and b are uncomplemented and c and d are complemented. Hence m 12 = abc / d /. m 12 is also the same as ( ) ( Binary form ) because 12 = If we combine all the minterms in the second
8 42 row R 2 we get R 2 = m 1 + m 3 + m 11 + m 9 = a / b / c / d + a / b / cd + a b / c d + a b / c / d. Applying the rules of Boolean Algebra we get R 2 = b / d = x 0 x 1. Similary the third column in Fig 3.2 represents the product ac = 1 x 1 x. In order to minimize a given Boolean function f it is first expressed as a sum of minterms and the corresponding cells in a Karnaugh map are considered. For example if n = 4 and f is the same as in Quine- McCluskey method i.e. f = m 1 + m 3 + m 6 + m 8 + m 9 + m 11 + m 12, then these minterms are shown in the shaded form as in the following figure. m 8 = (1000) b / d m 1 m 3 m 11 m 9 R 2 m 6 = (0110) m 12 = (1100) Fig. 3.3 From the figure it is clear that the minterm m 1, m 3, m 11 and m 9 together represent the row R 2 i.e. the product b / d. Further the minterms m 8 and m 12 can be combined to form the product ac / d /. The minterm m 6 ( = a / bcd / ) can not be combined with any of the other minterms in f and hence it is a prime implicant. Thus there are three prime implicants b / d, ac / d / and a / bcd / for the function f. Note that the minterm m 8 can also be combined with m 9 to form a prime implicant ( x ) = ab / c /, which was deleted in Quine McCluskey Method. Thus by an application of Theorem 2.1 we conclude that the minimal expression for f is f* = b / d + ac / d / + a / bcd /, which is the same as in Quine McCluskey Method.
9 43 The block diagram for the function f considered in the above described method using different types of gates is shown in figure 3.4. It contains 13 gates, while f* requires only 8 gates and the corresponding block diagram for f* is shown in figure 3.5. Note that the output for f and f* is the same since f and f* are equivalent. Fig. 3.4 Fig. 3.5 REMARKS: The method of minimizing a given Boolean function with the help of Karnaugh map becomes more and more clumzy as the number of variables in the Boolean function increases. This method is suitable only when the number of variables is 6. As far as the Quine-McClusky Method is concerned, it can be used for any finite number of variables since an algorithm for minimizung a Boolean function is available. Futher an algorithm can be converted into a computer program and the job of minimizing a functiuon becomes simpler.
10 44 ACKNOWLEDGEMENT I am grateful to Dr. G. R. Shendge for several useful discussions in the preparation of this paper. REFERENCES S.R. Joshi, Representation and Minization of Boolean Functions, part I Representation of Boolean Functions. The Bulletin of the Marthwada Mathematical Society, Dec. 2002, Segmour Lipschutz, and Morci Lipson, Discrete Mathematics ( 2nd Ed. ) Tata McGraw Hill Pub. Co. Ltd. New Delhi Thomas C. Bartee, Digital Computer Fundamentals ( 6 th Ed.) Tata McGraw Hill Pub.Co.Ltd. New Delhi J. P. Tremblay and R. Manohar, Discrete Mathmatical Structures with Applications to Computer Science, Tata McGraw Hill Barry Wilkinson, Digital Systems Design, Prentice Hall International, 1987.
Karnaugh 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 informationAdvanced Digital Design with the Verilog HDL, Second Edition Michael D. Ciletti Prentice Hall, Pearson Education, 2011
Problem 2-1 Recall that a minterm is a cube in which every variable appears. A Boolean expression in SOP form is canonical if every cube in the expression has a unique representation in which all of the
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 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 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 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 informationDigital Circuit And Logic Design I. Lecture 4
Digital Circuit And Logic Design I Lecture 4 Outline Combinational Logic Design Principles (2) 1. Combinational-circuit minimization 2. Karnaugh maps 3. Quine-McCluskey procedure Panupong Sornkhom, 2005/2
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 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 informationCSE 140: Components and Design Techniques for Digital Systems
Lecture 4: Four Input K-Maps CSE 4: Components and Design Techniques for Digital Systems CK Cheng Dept. of Computer Science and Engineering University of California, San Diego Outlines Boolean Algebra
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 informationCHAPTER 5 KARNAUGH MAPS
CHAPTER 5 1/36 KARNAUGH MAPS This chapter in the book includes: Objectives Study Guide 5.1 Minimum Forms of Switching Functions 5.2 Two- and Three-Variable Karnaugh Maps 5.3 Four-Variable Karnaugh Maps
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 informationLecture 4: Four Input K-Maps
Lecture 4: Four Input K-Maps CSE 4: Components and Design Techniques for Digital Systems Fall 24 CK Cheng Dept. of Computer Science and Engineering University of California, San Diego Outlines Boolean
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 informationDIGITAL ELECTRONICS & it0203 Semester 3
DIGITAL ELECTRONICS & it0203 Semester 3 P.Rajasekar & C.M.T.Karthigeyan Asst.Professor SRM University, Kattankulathur School of Computing, Department of IT 8/22/2011 1 Disclaimer The contents of the slides
More informationE&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev
E&CE 223 Digital Circuits & Systems Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev 4 of 92 Section 2: Boolean Algebra & Logic Gates Major topics Boolean algebra NAND & NOR gates Boolean
More informationL4: Karnaugh diagrams, two-, and multi-level minimization. Elena Dubrova KTH / ICT / ES
L4: Karnaugh diagrams, two-, and multi-level minimization Elena Dubrova KTH / ICT / ES dubrova@kth.se Combinatorial system a(t) not(a(t)) A combinatorial system has no memory - its output depends therefore
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 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 informationE&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev. Section 2: Boolean Algebra & Logic Gates
Digital Circuits & Systems Lecture Transparencies (Boolean lgebra & Logic Gates) M. Sachdev 4 of 92 Section 2: Boolean lgebra & Logic Gates Major topics Boolean algebra NND & NOR gates Boolean algebra
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 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 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 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 informationUnit 6. Quine-McClusky Method. Unit 6 1
Unit 6 Quine-McClusky Method Unit 6 1 Outline Determination of prime implicants The prime implicant chart Petrick s method Simplification of incompletely specified functions Unit 6 2 Overview (1/2) A systematic
More informationIntroduction to Digital Logic Missouri S&T University CPE 2210 Karnaugh Maps
Introduction to Digital Logic Missouri S&T University CPE 2210 Karnaugh Maps Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science and Technology
More informationChap 2. Combinational Logic Circuits
Overview 2 Chap 2. Combinational Logic Circuits Spring 24 Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard Forms Part 2 Circuit Optimization Two-Level Optimization
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 informationPrinciples of Computer Architecture. Appendix B: Reduction of Digital Logic. Chapter Contents
B-1 Principles of Computer Architecture Miles Murdocca and Vincent Heuring Appendix B: Reduction of Digital Logic B-2 Chapter Contents B.1 Reduction of Combinational Logic and Sequential Logic B.2 Reduction
More informationNumber System conversions
Number System conversions Number Systems The system used to count discrete units is called number system. There are four systems of arithmetic which are often used in digital electronics. Decimal Number
More information211: Computer Architecture Summer 2016
211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Storage: Recap - Review: cache hit rate - Project3 - Digital Logic: - truth table => SOP - simplification: Boolean
More informationAdvanced Boolean Logic and Applications to Control Systems
Advanced Boolean Logic and Applications to Control Systems Course No: E0-0 Credit: PDH Jeffrey Cwalinski, P.E. Continuing Education and Development, Inc. 9 Greyridge Farm Court Stony Point, NY 0980 P:
More informationCHAPTER III BOOLEAN ALGEBRA
CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.
More informationIntroduction to Karnaugh Maps
Introduction to Karnaugh Maps Review So far, you (the students) have been introduced to truth tables, and how to derive a Boolean circuit from them. We will do an example. Consider the truth table for
More informationLogic Design I (17.341) Fall Lecture Outline
Logic Design I (17.341) Fall 2011 Lecture Outline Class # 06 October 24, 2011 Dohn Bowden 1 Today s Lecture Administrative Main Logic Topic Homework 2 Course Admin 3 Administrative Admin for tonight Syllabus
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 informationENG2410 Digital Design Combinational Logic Circuits
ENG240 Digital Design Combinational Logic Circuits Fall 207 S. Areibi School of Engineering University of Guelph Binary variables Binary Logic Can be 0 or (T or F, low or high) Variables named with single
More informationCHAPTER III BOOLEAN ALGEBRA
CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Charles Kime & Thomas Kaminski 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active
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 informationReview for Test 1 : Ch1 5
Review for Test 1 : Ch1 5 October 5, 2006 Typeset by FoilTEX Positional Numbers 527.46 10 = (5 10 2 )+(2 10 1 )+(7 10 0 )+(4 10 1 )+(6 10 2 ) 527.46 8 = (5 8 2 ) + (2 8 1 ) + (7 8 0 ) + (4 8 1 ) + (6 8
More informationTotal Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18
University of Waterloo Department of Electrical & Computer Engineering E&CE 223 Digital Circuits and Systems Midterm Examination Instructor: M. Sachdev October 23rd, 2007 Total Time = 90 Minutes, Total
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 informationMODULAR CIRCUITS CHAPTER 7
CHAPTER 7 MODULAR CIRCUITS A modular circuit is a digital circuit that performs a specific function or has certain usage. The modular circuits to be introduced in this chapter are decoders, encoders, multiplexers,
More informationBoolean Algebra and Digital Logic 2009, University of Colombo School of Computing
IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of
More informationCombinational Logic Circuits Part II -Theoretical Foundations
Combinational Logic Circuits Part II -Theoretical Foundations Overview Boolean Algebra Basic Logic Operations Basic Identities Basic Principles, Properties, and Theorems Boolean Function and Representations
More informationCombinational Logic Fundamentals
Topic 3: Combinational Logic Fundamentals In this note we will study combinational logic, which is the part of digital logic that uses Boolean algebra. All the concepts presented in combinational logic
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 informationEECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive
EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive March 30, 2010 John Wawrzynek Spring 2010 EECS150 - Lec19-cl1 Page 1 Boolean Algebra I (Representations of Combinational
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 informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active
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 informationELCT201: DIGITAL LOGIC DESIGN
ELCT2: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 2 Following the slides of Dr. Ahmed H. Madian ذو الحجة 438 ه Winter
More informationWeek-I. Combinational Logic & Circuits
Week-I Combinational Logic & Circuits Overview Binary logic operations and gates Switching algebra Algebraic Minimization Standard forms Karnaugh Map Minimization Other logic operators IC families and
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 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 informationLogic Simplification. Boolean Simplification Example. Applying Boolean Identities F = A B C + A B C + A BC + ABC. Karnaugh Maps 2/10/2009 COMP370 1
Digital Logic COMP370 Introduction to Computer Architecture Logic Simplification It is frequently possible to simplify a logical expression. This makes it easier to understand and requires fewer gates
More informationBoolean Algebra CHAPTER 15
CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an
More informationCombinatorial Logic Design Principles
Combinatorial Logic Design Principles ECGR2181 Chapter 4 Notes Logic System Design I 4-1 Boolean algebra a.k.a. switching algebra deals with boolean values -- 0, 1 Positive-logic convention analog voltages
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 informationChapter 2. Digital Logic Basics
Chapter 2 Digital Logic Basics 1 2 Chapter 2 2 1 Implementation using NND gates: We can write the XOR logical expression B + B using double negation as B+ B = B+B = B B From this logical expression, we
More informationContents. Chapter 3 Combinational Circuits Page 1 of 36
Chapter 3 Combinational Circuits Page of 36 Contents Combinational Circuits...2 3. Analysis of Combinational Circuits...3 3.. Using a Truth Table...3 3..2 Using a Boolean Function...6 3.2 Synthesis of
More information( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function
Question Paper Digital Electronics (EE-204-F) MDU Examination May 2015 1. (a) represent (32)10 in (i) BCD 8421 code (ii) Excess-3 code (iii) ASCII code (b) Design half adder using only NAND gates. ( c)
More informationSimplifying Logic Circuits with Karnaugh Maps
Simplifying Logic Circuits with Karnaugh Maps The circuit at the top right is the logic equivalent of the Boolean expression: f = abc + abc + abc Now, as we have seen, this expression can be simplified
More informationMAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI
MAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI 6 DEPARTMENT: ECE QUESTION BANK SUBJECT NAME: DIGITAL ELECTRONICS UNIT I: Boolean Functions and Logic Gates PART -A ( Marks). What are the limitations of
More informationBoolean Algebra and Logic Simplification
S302 Digital Logic Design Boolean Algebra and Logic Simplification Boolean Analysis of Logic ircuits, evaluating of Boolean expressions, representing the operation of Logic circuits and Boolean expressions
More informationChapter 4: Designing Combinational Systems Uchechukwu Ofoegbu
Chapter 4: Designing Combinational Systems Uchechukwu Ofoegbu Temple University Gate Delay ((1.1).1) ((1.0).0) ((0.1).1) ((0.1).0) ((1.1) = 1 0 s = sum c out carry-out a, b = added bits C = carry in a
More informationSystems I: Computer Organization and Architecture
Systems I: Computer Organization and Architecture Lecture 6 - Combinational Logic Introduction A combinational circuit consists of input variables, logic gates, and output variables. The logic gates accept
More informationChapter 2 Boolean Algebra and Logic Gates
Ch1: Digital Systems and Binary Numbers Ch2: Ch3: Gate-Level Minimization Ch4: Combinational Logic Ch5: Synchronous Sequential Logic Ch6: Registers and Counters Switching Theory & Logic Design Prof. Adnan
More informationDHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN
DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN UNIT I : BOOLEAN ALGEBRA AND LOGIC GATES PART - A (2 MARKS) Number
More informationCHAPTER 12 Boolean Algebra
318 Chapter 12 Boolean Algebra CHAPTER 12 Boolean Algebra SECTION 12.1 Boolean Functions 2. a) Since x 1 = x, the only solution is x = 0. b) Since 0 + 0 = 0 and 1 + 1 = 1, the only solution is x = 0. c)
More informationCSCI 220: Computer Architecture-I Instructor: Pranava K. Jha. BCD Codes
CSCI 220: Computer Architecture-I Instructor: Pranava K. Jha BCD Codes Q. Give representation of the decimal number 853 in each of the following codes. (a) 8421 code (c) 84(-2)(-1) code (b) Excess-three
More informationCDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012
CDA 3200 Digital Systems Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012 Outline Combinational Logic Design Using a Truth Table Minterm and Maxterm Expansions General Minterm and
More informationLOGIC GATES. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.
Basic Eperiment and Design of Electronics LOGIC GATES Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Outline Boolean algebra Logic gates Karnaugh maps
More informationCS/EE 181a 2008/09 Lecture 4
CS/EE 181a 28/9 Lecture 4 General topic of today s lecture: Logic Optimization Karnaugh maps. Quine-McCluskey tabulation method (not in detail). Non series-parallel networks (some care is required). Reference
More informationDIGITAL TECHNICS I. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute 5. LECTURE: LOGIC SYNTHESIS
202.0.5. DIGITL TECHNICS I Dr. Bálint Pődör Óbuda University, Microelectronics and Technology Institute 5. LECTURE: LOGIC SYNTHESIS st year BSc course st (utumn) term 202/203 5. LECTURE. Karnaugh map applications
More informationCHAPTER 3 BOOLEAN ALGEBRA
CHAPTER 3 BOOLEAN ALGEBRA (continued) This chapter in the book includes: Objectives Study Guide 3.1 Multiplying Out and Factoring Expressions 3.2 Exclusive-OR and Equivalence Operations 3.3 The Consensus
More informationCombinational Logic Design/Circuits
3 ` Combinational Logic Design/Circuits Chapter-3(Hours : 12 Marks:24 ) Combinational Logic design / Circuits 3.1 Simplification of Boolean expression using Boolean algebra. 3.2 Construction of logical
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 informationCPE100: Digital Logic Design I
Chapter 2 Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu http://www.ee.unlv.edu/~b1morris/cpe100/ CPE100: Digital Logic Design I Section 1004: Dr. Morris Combinational Logic Design Chapter
More informationReg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering
Sp 6 Reg. No. Question Paper Code : 27156 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2015. Second Semester Computer Science and Engineering CS 6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN (Common
More informationUnit 3 Session - 9 Data-Processing Circuits
Objectives Unit 3 Session - 9 Data-Processing Design of multiplexer circuits Discuss multiplexer applications Realization of higher order multiplexers using lower orders (multiplexer trees) Introduction
More informationDigital Logic (2) Boolean Algebra
Digital Logic (2) Boolean Algebra Boolean algebra is the mathematics of digital systems. It was developed in 1850 s by George Boole. We will use Boolean algebra to minimize logic expressions. Karnaugh
More informationDigitalteknik EIT020. Lecture 10: Kanaugh Maps
Digitalteknik EIT020 Lecture 10: Kanaugh Maps October 2, 2015 Note regarding notation Some notation in the Compendium has changed from older versions. Normal forms for Boolean functions DNF (Disjunctive
More informationBinary logic consists of binary variables and logical operations. The variables are
1) Define binary logic? Binary logic consists of binary variables and logical operations. The variables are designated by the alphabets such as A, B, C, x, y, z, etc., with each variable having only two
More informationEE40 Lec 15. Logic Synthesis and Sequential Logic Circuits
EE40 Lec 15 Logic Synthesis and Sequential Logic Circuits Prof. Nathan Cheung 10/20/2009 Reading: Hambley Chapters 7.4-7.6 Karnaugh Maps: Read following before reading textbook http://www.facstaff.bucknell.edu/mastascu/elessonshtml/logic/logic3.html
More informationPI = { a.b.c, ac d, b cd, ab d, bd} cd
Digital Logic Design: Principles and Practices ELG5195 (EACJ5705 ), Carleton CRN: 18371 Assignment #1 Question 1: a) Using iterated consensus find all the prime implicants of the following function: F(
More informationReview. EECS Components and Design Techniques for Digital Systems. Lec 06 Minimizing Boolean Logic 9/ Review: Canonical Forms
Review EECS 150 - Components and Design Techniques for Digital Systems Lec 06 Minimizing Boolean Logic 9/16-04 David Culler Electrical Engineering and Computer Sciences University of California, Berkeley
More information1 Boolean Algebra Simplification
cs281: Computer Organization Lab3 Prelab Our objective in this prelab is to lay the groundwork for simplifying boolean expressions in order to minimize the complexity of the resultant digital logic circuit.
More informationChapter 2. Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates Basic Definitions A binary operator defined on a set S of elements is a rule that assigns, to each pair of elements from S, a unique element from S. The most common
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 informationCS/EE 181a 2010/11 Lecture 4
CS/EE 181a 21/11 Lecture 4 General topic of today s lecture: Logic Optimization Karnaugh maps. Quine-McCluskey tabulation method (not in detail). Non series-parallel networks (some care is required). Reference
More informationBoolean Algebra and Digital Logic
All modern digital computers are dependent on circuits that implement Boolean functions. We shall discuss two classes of such circuits: Combinational and Sequential. The difference between the two types
More informationReview Getting the truth table
Digital Circuits Review Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every input combination, figure out what an output bit should
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 informationChapter 3. Boolean Algebra. (continued)
Chapter 3. Boolean Algebra (continued) Algebraic structure consisting of: set of elements B binary operations {+, -} unary operation {'} Boolean Algebra such that the following axioms hold:. B contains
More informationKarnaugh Maps (K-Maps)
Karnaugh Maps (K-Maps) Boolean expressions can be minimized by combining terms P + P = P K-maps minimize equations graphically Put terms to combine close to one another B C C B B C BC BC BC BC BC BC BC
More information14:332:231 DIGITAL LOGIC DESIGN. Combinational Circuit Synthesis
:: DIGITAL LOGIC DESIGN Ivan Marsic, Rutgers University Electrical & Computer Engineering all Lecture #: Combinational Circuit Synthesis I Combinational Circuit Synthesis Recall: Combinational circuit
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 information