Chapter 2 Combinational logic
|
|
- Randall Horn
- 5 years ago
- Views:
Transcription
1 Chapter 2 Combinational logic Chapter 2 is very easy. I presume you already took discrete mathemtics. The major part of chapter 2 is boolean algebra. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz
2 Combinational logic Basic logic Boolean algebra, proofs by re-writing, proofs by perfect induction logic functions, truth tables, and switches NOT, AND, OR, NAND, NOR, XOR,..., minimal set Logic realization two-level logic and canonical forms incompletely specified functions Simplification uniting theorem grouping of terms in Boolean functions Alternate representations of Boolean functions cubes Karnaugh maps Before beginning the main part of combinational logic, let s see boolean algebra first Mastering boolean algebra will make it easy for you to handle digital logic e.g. just like Boolean logic expressions, we can simplify digital logic circuits The final part of this chapter is the way to represent boolean functions, which facilitates the logic simplification II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 2
3 Possible logic functions of two variables There are 6 possible functions of 2 input variables: in general, there are 2**(2**n) functions of n inputs X Y F X Y F F F3 F6 F9 F2 F5 X and Y X Y X xor Y X or Y X = Y X nor Y not (X or Y) not Y not X X nand Y not (X and Y) Suppose there are two inputs and one output in a digital system How many different functions can be defined? Different functions mean that at least one output is different for all cases of input values First of all, there are 4 cases of inputs (2**n for n inputs). For each case, the output can be either or. So total 2**4 kinds of output functions can be defined. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 3
4 Cost of different logic functions Different functions are easier or harder to implement each has a cost associated with the number of switches needed (F) and (F5): require switches, directly connect output to low/high X (F3) and Y (F5): require switches, output is one of inputs X (F2) and Y (F): require 2 switches for "inverter" or NOT-gate X nor Y (F4) and X nand Y (F4): require 4 switches X or Y (F7) and X and Y (F): require 6 switches X = Y (F9) and X Y (F6): require 6 switches thus, because NOT, NOR, and NAND are the cheapest they are the functions we implement the most in practice Depending on the output values of a function, the cost to implement the logic function is different. At the simplest end of spectrum, we don t need a switch in F and F5. Recall that two input NAND and NOR function requires two pair of CMOS TRs, 4 switches. So AND and OR gates can be implemented by adding an inverter to NAND and NOR, respectively. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 4
5 Minimal set of functions Can we implement all logic functions from NOT, NOR, and NAND? For example, implementing X and Y is the same as implementing not (X nand Y) In fact, we can do it with only NOR or only NAND NOT is just a NAND or a NOR with both inputs tied together X Y X nor Y X Y X nand Y and NAND and NOR are "duals", that is, its easy to implement one using the other X nand Y not ( (not X) nor (not Y) ) X nor Y not ( (not X) nand (not Y) ) All kinds of logic functions (6 functions in the previous slide) can be implemented only by using NOR, NAND, and NOT Actually, NOT can also be implemented by NOR or NAND if we tie both inputs. NOR and NAND has somewhat contrastive properties, dubbed dual, which means one can be transformed to another in a simple and symmetric fashion. Put simply, just add inverters on all inputs and outputs. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 5
6 An algebraic structure An algebraic structure consists of a set of elements B binary operations { +, } and a unary operation { } such that the following axioms hold: Identity (element) 항등원 Inverse (element) 역원. the set B contains at least two elements: a, b 2. closure: a + b is in B a b is in B 3. commutativity: a + b = b + a a b = b a 4. associativity: a + (b + c) = (a + b) + c a (b c) = (a b) c 5. identity: a + = a a = a 6. distributivity: a + (b c) = (a + b) (a + c) a (b + c) = (a b) + (a c) 7. complementarity: a + a = a a = Before moving on to Boolean algebra, let s see how a general algebraic structure can be defined in mathematical perspective. When we refer to algebra, it deals with the relations or properties of entities or elements. Do you remember linear algebra? What are the key axioms for linear algebra? For all a,b that belong to a set S, a+b and k*a also belong to S and a+b = b+a, a*b = b*a II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 6
7 Boolean algebra Boolean algebra B = {, } variables + is logical OR, is logical AND is logical NOT All algebraic axioms hold Then, Boolean algebra is one special branch of algebra Any boolean variable takes either or. and the previous axioms hold for boolean variables as an algebraic structure. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 7
8 Logic functions and Boolean algebra Any logic function that can be expressed as a truth table can be written as an expression in Boolean algebra using the operators:, +, and X Y X Y X Y X X Y X Y X Y X Y X Y ( X Y ) + ( X Y ) ( X Y ) + ( X Y ) X = Y X, Y are Boolean algebra variables Boolean expression that is true when the variables X and Y have the same value and false, otherwise We already know that any boolean function (say, one of 6 functions of two inputs) can be described by a truth table. And any boolean function can be expressed by a boolean algebra using the variables and operators in the last slide. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 8
9 Axioms and theorems of Boolean algebra identity. X + = X D. X = X null 2. X + = 2D. X = idempotency: 3. X + X = X 3D. X X = X involution: 4. (X ) = X Idempotency: one may derive the same consequences from many instances of a hypothesis as from just one complementarity: 5. X + X = 5D. X X = commutativity: 6. X + Y = Y + X 6D. X Y = Y X associativity: 7. (X + Y) + Z = X + (Y + Z) 7D. (X Y) Z = X (Y Z) Here is the list of properties of Boolean algebra. Note that suffix D means the dual of the original expression. Dual is the other symmetric part of a pair, which will be discussed later. (at this moment, use two rules: AND<-> OR, <->) II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 9
10 Axioms and theorems of Boolean algebra (cont d) distributivity: 8. X (Y + Z) = (X Y) + (X Z) 8D. X + (Y Z) = (X + Y) (X + Z) uniting: 9. X Y + X Y = X 9D. (X + Y) (X + Y ) = X absorption:. X + X Y = X D. X (X + Y) = X. (X + Y ) Y = X Y D. (X Y ) + Y = X + Y factoring: 2. (X + Y) (X + Z) = 2D. X Y + X Z = X Z + X Y (X + Z) (X + Y) concensus: 3. (X Y) + (Y Z) + (X Z) = 3D. (X + Y) (Y + Z) (X + Z) = X Y + X Z (X + Y) (X + Z) Uniting theorem is very useful for minimizing logic systems. Actually, absorption is also useful in logic simplification. What is a hint here? Focus on the complements Let s look at theorem 2. (X+Y)(X +Z) = XX +XZ+X Y+YZ =XZ+X Y+YZ(X+X ) =XZ(+Y)+X Y(+Z) =XZ+X Y II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz
11 Axioms and theorems of Boolean algebra (cont d) de Morgan s: 4. (X + Y +...) = X Y... 4D. (X Y...) = X + Y +... generalized de Morgan s: 5. f (X,X 2,...,X n,,,+, ) = f(x,x 2,...,X n,,,,+) establishes relationship between and + When a complement operator goes into the parenthesis, an AND or OR operator is switched to the other, not to mention literals are inverted. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz
12 Axioms and theorems of Boolean algebra (cont d) Duality a dual of a Boolean expression is derived by replacing by +, + by, by, and by, and leaving variables unchanged any theorem that can be proven is thus also proven for its dual! a meta-theorem (a theorem about theorems) duality: 6. X + Y +... X Y... generalized duality: 7. f (X,X 2,...,X n,,,+, ) f(x,x 2,...,X n,,,,+) Different than demorgan s Law this is a statement about theorems this is not a way to manipulate (re-write) expressions If some theorem is true, its dual is also true. Most theorems have their duals Note that de Morgan s law just presents a way of conversion. Meanwhile duality states that there is another theorem for each theorem. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 2
13 Proving theorems (rewriting) Using the axioms of Boolean algebra: e.g., prove the theorem: X Y + X Y = X distributivity (8) X Y + X Y = X (Y + Y ) complementarity (5) X (Y + Y ) = X () identity (D) X () = X e.g., prove the theorem: X + X Y = X identity (D) X + X Y = X + X Y distributivity (8) X + X Y = X ( + Y) null (2) X ( + Y) = X () identity (D) X () = X There are a few ways to prove theorems. The first one is using other theorems and axioms in the previous slides. When you see XY + XY, there is a common factor X. By applying distributivity theorem, we can factor out X. so we can rewrite as X(Y+Y ) II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 3
14 Proving theorems (perfect induction) Using perfect induction (complete truth table): e.g., de Morgan s: (X + Y) = X Y NOR is equivalent to AND with inputs complemented X Y X Y (X + Y) X Y (X Y) = X + Y NAND is equivalent to OR with inputs complemented X Y X Y (X Y) X + Y The second method to prove theorems is to use truth-tables. These tables prove de morgan s theorem by using truth tables. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 4
15 A simple example: -bit binary adder Cout Cin Inputs: A, B, Carry-in Outputs: Sum, Carry-out A A A A A B B B B B S S S S S A B Cin Cout S A B Cin S Cout S = A B Cin + A B Cin + A B Cin + A B Cin Cout = A B Cin + A B Cin + A B Cin + A B Cin Let s design a one bit adder which calculates the sum of two bits (one bit for each number) Note that there can be a carry-in value from the lower position bits, denoted by Cin When there are an even number of s among three inputs, S will be. When two or more s among three inputs, Cout will be. Cout becomes true in 4 cases. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 5
16 Apply the theorems to simplify expressions The theorems of Boolean algebra can simplify Boolean expressions e.g., full adder s carry-out function (same rules apply to any function) Cout = A B Cin + A B Cin + A B Cin + A B Cin = A B Cin + A B Cin + A B Cin + A B Cin + A B Cin = A B Cin + A B Cin + A B Cin + A B Cin + A B Cin = (A + A) B Cin + A B Cin + A B Cin + A B Cin = () B Cin + A B Cin + A B Cin + A B Cin = B Cin + A B Cin + A B Cin + A B Cin + A B Cin = B Cin + A B Cin + A B Cin + A B Cin + A B Cin = B Cin + A (B + B) Cin + A B Cin + A B Cin = B Cin + A () Cin + A B Cin + A B Cin = B Cin + A Cin + A B (Cin + Cin) = B Cin + A Cin + A B () = B Cin + A Cin + A B adding extra terms creates new factoring opportunities Now we will show how Cout can be reduced by using theorems in Boolean algebra. The question that comes up in your mind will be how we can find such a clue to simplification? Always focus on complements. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 6
17 From Boolean expressions to logic gates NOT X X ~X X Y X Y AND X Y XY X Y X Y Z X Y Z OR X + Y X Y X Y Z X Y Z Let s see how Boolean expressions can be represented by logic gates II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 7
18 From Boolean expressions to logic gates (cont d) NAND X Y Z X Y Z NOR X Y Z X Y Z XOR X Y X Y Z X Y Z X xor Y = X Y + X Y X or Y but not both ("inequality", "difference") XNOR X = Y X Y Z X Y Z X xnor Y = X Y + X Y X and Y are the same ("equality", "coincidence") The bubble at the tip indicates an inverter. XNOR is the negation of XOR, which is true when both X and Y have the same value II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 8
19 From Boolean expressions to logic gates (cont d) More than one way to map expressions to gates e.g., Z = A B (C + D) = (A (B (C + D))) T2 T use of 3-input gate A Z A B T B Z C D T2 C D There can be multiple choices in implementing the same boolean expression by logic gates. Then we should compare these choices. The logic circuit on the left is for the 2nd expression and the one on the right is for the st expression. Is there any difference in these two realizations? II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 9
20 Waveform view of logic functions Just a sideways truth table but note how edges don t line up exactly it takes time for a gate to switch its output! time change in Y takes time to "propagate" through gates There IS difference; it takes time for a signal to pass through each gate. Waveform describes how a signal at each point changes over time Suppose X and Y change at precise timing. Depending on the gate type, the gate passing delay can be slightly different. e.g. an XOR gate is complicated, which incurs a longer delay than other simple gates II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 2
21 Choosing different realizations of a function A B C Z Z = A B C + A BC + AB C + ABC Z = ABC + A C + B C Z2 = ABC + (AB) C Z3 = AB C two-level realization (we don t count NOT gates) p.53 multi-level realization (gates with fewer inputs) XOR gate (easier to draw but costlier to build) We will see three variations of the same logic expression here. Z=Z2=Z3=Z Let s consider Z first. 3 AND gates and OR gate. Also we need to check the # of wires or inputs. In Z3, XOR is called a complex gate, which requires several NAND or NOR gates. So Z3 is likely to have the worst delay. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 2
22 XOR implementations Three levels of logic inside a XOR gate X Y = X Y + XY X X Y Y X X Y Y II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 22
23 Which realization is best? Reduce number of inputs literal: input variable (complemented or not) can approximate cost of logic gate as 2 transistors per literal why not count inverters? fewer literals means less transistors smaller circuits fewer inputs implies faster gates gates are smaller and thus also faster fan-ins (# of gate inputs) are limited in some technologies Reduce number of gates fewer gates (and the packages they come in) means smaller circuits directly influences manufacturing costs One literal can be approximated by two transistors. We already looked at two-input and three-input NAND gates and the numbers of TRs. In many cases, an inverter function is already included for each literal. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 23
24 Which is the best realization? (cont d) Reduce number of levels of gates fewer level of gates implies reduced signal propagation delays minimum delay configuration typically requires more gates wider, less deep circuits How do we explore tradeoffs between increased circuit delay and size? automated tools to generate different solutions logic minimization: reduce number of gates and complexity logic optimization: reduction while trading off against delay As more gates are cascaded, the overall delay will be increased e.g. AB+(AB) In general, there is a tradeoff between the delay and the number of gates. Let s compare Z and Z3 Depending on the criteria (e.g. minimize delay, minimize the # of gates), the CAD tools can yield different solutions. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 24
25 Are all realizations equivalent? Under the same input stimuli, the three alternative implementations have almost the same waveform behavior delays are different glitches (hazards) may arise these could be bad, it depends variations due to differences in number of gate levels and structure The three implementations are functionally equivalent For the same function, we looked at the three implementations. Even though they are equivalent with a steady state viewpoint, the transient behavior may be a little bit different Typically, a transient behavior takes place right after there is some change in input values. In the next slide, we will see why there is a hole in the waveform. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 25
26 Choosing different realizations of a function A B C Z A = B = C = two-level realization (we don t count NOT gates) Assume the same delay for all gates A B C multi-level realization (gates with fewer inputs) C XOR gate (easier to draw but costlier to build) Let s see Z2. First, input variables are changing. B goes from to while C goes from to, and these changes are propagated through gates. The delays are accumulated as the signal goes through more gates. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 26
27 Implementing Boolean functions Technology independent canonical forms two-level forms multi-level forms Technology choices packages of a few gates regular logic two-level programmable logic multi-level programmable logic Ok. We can understand that there can be various implementations for the same boolean expression. A Boolean function can take one of various expressions. So, there is some taxonomy about how we can express a logic function. One category includes technology-independent forms. The other approach highly depends on the implementation technologies. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 27
28 Canonical forms Truth table is the unique signature of a Boolean function The same truth table can have many gate realizations Canonical forms standard forms for a Boolean expression provides a unique algebraic signature The unique identifier of a logic function is the truth table, no matter what. Again, the same truth table has many variations in gate design. So we want to standardize how to map a truth table to a boolean expression in designing logic systems. One of the simple and intuitive expression of the output function is to use canonical forms, which have two alternatives. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 28
29 Sum-of-products (S-o-P) canonical forms Also known as (aka) disjunctive normal form Also known as minterm expansion F = A B C + A BC + AB C + ABC + ABC A B C F F F = F = A B C + A BC + AB C This sum of products (SOP) canonical form may be easiest. Just check all the cases when F becomes true and each case forms the product of input variables. And finally, ORing these products will yield the final expression. This is also called minterm expansion; here, a minterm is a product of all the input literals. Each literal should appear once in each minterm: asserted or complemented II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 29
30 Sum-of-products canonical form (cont d) Product term (or minterm) ANDed product of literals input combination for which output is true each variable appears exactly once, true or inverted (but not both) A B C minterms A B C m A B C m A BC m2 A BC m3 AB C m4 AB C m5 ABC m6 ABC m7 short-hand notation for minterms of 3 variables F in canonical form: F(A, B, C) = Σm(,3,5,6,7) = m + m3 + m5 + m6 + m7 = A B C + A BC + AB C + ABC + ABC canonical form minimal form F(A, B, C) = A B C + A BC + AB C + ABC + ABC = (A B + A B + AB + AB)C + ABC = ((A + A)(B + B))C + ABC = C + ABC = ABC + C = AB + C Each product is called a minterm, and denoted by small m and a decimal number for the binary input values Note that there is no reduction or minimization in canonical forms; each variable must appear once for each product II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 3
31 Product-of-sums (P-o-S) canonical form Also known as conjunctive normal form Also known as maxterm expansion F = F = (A + B + C) (A + B + C) (A + B + C) A B C F F F = (A + B + C ) (A + B + C ) (A + B + C ) (A + B + C) (A + B + C ) The other canonical form is P-o-S. This one focuses on when F will be. P-o-S is like the dual of S-o-P. First of all, we check all the cases that make F false or The variables for each case or term are first complemented and then connected by the OR operation. This ORed term is called maxterm. Eventually, these terms are connected by AND. What does the final expression mean? II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 3
32 Product-of-sums canonical form (cont d) Sum term (or maxterm) ORed sum of literals input combination for which output is false each variable appears exactly once, true or inverted (but not both) A B C maxterms A+B+C M A+B+C M A+B +C M2 A+B +C M3 A +B+C M4 A +B+C M5 A +B +C M6 A +B +C M7 short-hand notation for maxterms of 3 variables F in canonical form: F(A, B, C) = ΠM(,2,4) = M M2 M4 = (A + B + C) (A + B + C) (A + B + C) canonical form minimal form F(A, B, C) = (A + B + C) (A + B + C) (A + B + C) = (A + B + C) (A + B + C) (A + B + C) (A + B + C) = (A + C) (B + C) Each term is called a maxterm, denoted by the capital M and the decimal value of input variables. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 32
33 S-o-P, P-o-S, and de Morgan s theorem Sum-of-products F = A B C + A BC + AB C Apply de Morgan s (F ) = (A B C + A BC + AB C ) F = (A + B + C) (A + B + C) (A + B + C) Product-of-sums F = (A + B + C ) (A + B + C ) (A + B + C ) (A + B + C) (A + B + C ) Apply de Morgan s (F ) = ( (A + B + C )(A + B + C )(A + B + C )(A + B + C)(A + B + C ) ) F = A B C + A BC + AB C + ABC + ABC And we can verify the equivalence of SoP and PoS here by de Morgan s theorem As we know F and F are complementary to each other; so F = (F ). Let s check this out. If we express F in the SOP form, there are three cases that make F true. The sum of three minterms are complemented, which is F. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 33
34 Four alternative two-level implementations of F = AB + C A B C F F2 canonical sum-of-products minimized sum-of-products F3 canonical product-of-sums F4 minimized product-of-sums Recall that F = AB+C which has 5 terms in the S-o-P canonical form in the previous example. It has 3 terms in the P-o-S canonical terms II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 34
35 Waveforms for the four alternatives Waveforms are essentially identical except for timing hazards (glitches) delays almost identical (modeled as a delay per level, not type of gate or number of inputs to gate) Even though F, F2, F3 and F4 are equivalent, their transient behaviors may be different II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 35
36 Mapping between canonical forms Minterm to maxterm conversion use maxterms whose indices do not appear in minterm expansion e.g., F(A,B,C) = Σm(,3,5,6,7) = ΠM(,2,4) Maxterm to minterm conversion use minterms whose indices do not appear in maxterm expansion e.g., F(A,B,C) = ΠM(,2,4) = Σm(,3,5,6,7) Minterm expansion of F to minterm expansion of F use minterms whose indices do not appear e.g., F(A,B,C) = Σm(,3,5,6,7) F (A,B,C) = Σm(,2,4) Maxterm expansion of F to maxterm expansion of F use maxterms whose indices do not appear e.g., F(A,B,C) = ΠM(,2,4) F (A,B,C) = ΠM(,3,5,6,7) Using complementarity, minterm can be converted to maxterm and vice versa. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 36
37 Incompletely specified functions Example: binary coded decimal (BCD) increment by BCD digits encode the decimal digits 9 in the bit patterns A B C D W X Y Z X X X X X X X X X X X X X X X X X X X X X X X X off-set of W on-set of W don t care (DC) set of W On-set: the set of cases whose output is these inputs patterns should never be encountered in practice "don t care" about associated output values, can be exploited in minimization In some logic functions, there can be input values which does not matter; we can map any output to those input values. BCD coding uses only ten values from to 9. With 4 input lines, we have 6 don t care cases of input values. For these don t care values, the function can have any arbitrary output values II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 37
38 Notation for incompletely specified functions Don t cares and canonical forms so far, we focus on either on-set or off-set There can be don t-care-set need two of the three sets (on-set, off-set, dc-set) Canonical representations of the BCD increment by function: Z = m + m2 + m4 + m6 + m8 + d + d + d2 + d3 + d4 + d5 Z = Σ [ m(,2,4,6,8) + d(,,2,3,4,5) ] Z = M M3 M5 M7 M9 D D D2 D3 D4 D5 Z = Π [ M(,3,5,7,9) D(,,2,3,4,5) ] In two standard canonical forms, SOP and PoS, we consider only either on-set or off-set And now we have a don t care (DC) set, which can be utilized for logic minimization. We can map either or arbitrarily for the case in the DC set So we have to extend the definition of canonical forms by incorporating don t care terms In SoP forms, a don t care term is denoted by d and the decimal number for the binary value. Whereas, in PoS forms, a DC term is denoted by D and the decimal number for the input II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 38
39 Simplification of two-level combinational logic Finding a minimal sum of products or product of sums realization exploit don t care information in the process Algebraic simplification not an algorithmic/systematic procedure how do you know when the minimum realization has been found? Computer-aided design tools precise solutions require very long computation times, especially for functions with many inputs (> ) heuristic methods employed "educated guesses" to reduce amount of computation and yield good if not best solutions Hand methods still relevant to understand automatic tools and their strengths and weaknesses ability to check results (on small examples) We can use theorems or rules of Boolean algebra in logic minimizations. Also, we can utilize don t care terms by treating them as s or s arbitrarily for our advantage. The manual solution may not yield a good minimization. Then CAD tools may come into play. They perform the logic minimizations systematically. However, if there are many input variables, the boolean function will be extremely complicated even for CAD tools. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 39
40 Two minimization techniques Boolean cubes Karnaugh-maps (K-maps) Both of them are based on the uniting theorem So we will see two systematic procedures to minimize logic functions. Boolean cubes and K-maps. As both of them are based on the uniting theorem of boolean algebra, we will look at it first. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 4
41 The uniting theorem Key tool to simplification: A (B + B) = A Essence of simplification of two-level logic find two element subsets of the ON-set where only one variable changes its value this single varying variable can be eliminated and a single product term used to represent both elements A B F F = A B +AB = (A +A)B = B B has the same value in both on-set rows B remains (in complemented form) A has a different value in the two rows A is eliminated One of the most useful theorem for simplifying logic systems is the uniting theorem in boolean algebra. Let s see how the uniting theorem is represented in the truth table. There are two cases or elements that make F true. One variable is not changed while the other literal is toggled. Ultimately, we want to apply the uniting theorem to the truth table directly without resorting to boolean expressions. And there are two well-known techniques. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 4
42 Boolean cubes Visual technique for identifying when the uniting theorem can be applied n input variables = n-dimensional "cube" -cube X Y X 2-cube 3-cube Y Z X Y Z 4-cube The first technique to exploit the uniting theorem is to use boolean cubes. The dimension of a cube is the number of input variables. In 2-cube, the first bit is X and the second is Y. Boolean cubes are used to check whether there is a reducible variable by applying the uniting theorem. Let s see how we can put indices to each node. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 42 X W
43 Mapping truth tables onto Boolean cubes Uniting theorem combines two "faces" of a cube into a larger "face" Example: A B F B F two faces of size (nodes) combine into a face of size (line) A ON-set = solid nodes OFF-set = empty nodes DC-set = 'd nodes A varies within face, B does not this face represents the literal B' Let s look at the details of the boolean cube technique. First of all, we fill in the nodes that correspond to the elements of the ON-set. If there are two adjacent solid nodes, we can use the uniting theorem. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 43
44 Three variable example Binary full-adder carry-out logic (A'+A)BCin A B Cin Cout Cout = BCin+AB+ACin B C A AB(Cin'+Cin) A(B+B')Cin the on-set is completely covered by the combination (OR) of the subcubes of lower dimensionality - note that is covered three times This slide shows how Boolean cubes can reduce the logic expression of a full-adder. There are three instances that we can use the uniting theorem in this example. You can see that adjacent nodes are different only in a single bit. Let s examine three cases. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 44
45 Higher dimensional cubes Sub-cubes of higher dimension than 2 F(A,B,C) = Σm(4,5,6,7) B C A on-set forms a square i.e., a cube of dimension 2 represents an expression in one variable i.e., 3 dimensions 2 dimensions A is asserted (true) and unchanged B and C vary This subcube represents the literal A Suppose the output boolean variable is Σm(4,5,6,7) in S-O-P form. In this case, the on-set nodes form a square. Here, we use the uniting theorem at a greater scale. A(BC+BC +B C+B C ) = A II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 45
46 m-dimensional cubes in a n-dimensional Boolean space In a 3-cube (three variables): a -cube, i.e., a single node, yields a term in 3 literals a -cube, i.e., a line of two nodes, yields a term in 2 literals a 2-cube, i.e., a plane of four nodes, yields a term in literal a 3-cube, i.e., a cube of eight nodes, yields a constant term "" In general, an m-subcube within an n-cube (m < n) yields a term with n m literals In general, in n-dim. boolean cubes, an m-dim. subcube (made from the elements of the on-set) can yield a term with n-m literals. That is, 2**m minterms can be reduced to a single term! II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 46
47 Karnaugh maps Flat map of Boolean cube wrap around at edges hard to draw and visualize for more than 4 dimensions virtually impossible for more than 6 dimensions Alternative to truth-tables to help visualize adjacencies guide to applying the uniting theorem on-set elements with only one variable changing value are adjacent unlike the situation in a linear truth-table B A 2 3 A B F Another technique is using a Karnaugh map, which is kind of a flat version of the Boolean cube technique. A K-map of two inputs are shown on the left. In each cell of the table, the numbers in black indicates the truth value while the numbers in blue indicate the decimal number of binary input values II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 47
48 Karnaugh maps (cont d) Numbering scheme based on Gray code e.g.,,,, only a single bit changes in code for adjacent map cells C C AB C B A A B C D II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 48 A 5 4 B 3 = = ABC D This slide shows a Karnaugh map of 3 and 4 inputs. The thick line segment represents the domain (in the perpendicular direction) where each variable is always TRUE. The other thin line segment(s) represents the domain where each variable is always FALSE. Adjacent cells are different only in one bit; that is the key property to use the uniting theorem.
49 Adjacencies in Karnaugh maps Wrap from first to last column Wrap top row to bottom row A C B C B A Let s focus on cell, there are three adjacent cells as also illustrated in the boolean cube. Note that the number of adjacent cells is the same as the number of input variables since it is equal to the number of bits. Let s go back to the previous slide and check the adjacent cells in a 4 input Karnaugh map. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 49
50 Karnaugh map examples F = A Cout = B B f(a,b,c) = Σm(,4,5,7) A AB+ ACin + BCin Cin A B C B AC + B C + AB The on-set included in the red oval is already covered by two other adjacencies Let s look at three examples and how a Karnaugh map is used for simplification by using the uniting theorem. In the last example, we don t need to express the terms in the red circle, why? II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 5
51 More Karnaugh map examples A C B G(A,B,C) = A * exercises A C F(A,B,C) = Σm(,4,5,7) = AC + B C B C B A F' simply replace 's with 's and vice versa F'(A,B,C) = Σ m(,2,3,6) = BC + A C The first example shows a single group, which includes all the elements when A is. The second and third examples are complementary. The off-set of the 2 nd example becomes the on-set of the 3 rd example. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 5
52 Karnaugh map: 4-variable example F(A,B,C,D) = Σm(,2,3,5,6,7,8,,,4,5) F = C + A BD + B D A C B D C D find the smallest number of the largest possible subcubes to cover the ON-set (fewer terms with fewer inputs per term) Remember what we need to do is to find out the minimum set of subcubes, which covers all the s, or all the elements of the on-set. The subset of 8 minterms is expressed by a green cube on the right in Boolean cube techniques. Likewise, the four minterms at all 4 corners are represented by sky blue plane. The last two terms in the middle is the brownish oval. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 52 B A
53 Karnaugh maps: don t cares (DCs) f(a,b,c,d) = Σ m(,3,5,7,9) + d(6,2,3) without don't cares f = A D + B C D A X X D C X B Now let s see how we can utilize DC terms in the Karnaugh map technique. If we don t use DC terms, the logic function f is A D +B C D II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 53
54 Karnaugh maps: don t cares (cont d) f(a,b,c,d) = m(,3,5,7,9) + d(6,2,3) f = A'D + B'C'D without don't cares f = A'D + C'D with don't cares C X B A X X D by using don't care as a "" a 2-cube can be formed rather than a -cube to cover this node don't cares can be treated as s or s depending on which is more advantageous Let s check the power of DC terms here. By interpreting DCs as s opportunistically, we can make greater adjacency as shown here. Opportunistically means that we utilize only the DC terms that maximize the size of the on-set. II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 54
55 Combinational logic summary Logic functions, truth tables, and switches NOT, AND, OR, NAND, NOR, XOR,..., minimal set Axioms and theorems of Boolean algebra proofs by re-writing and perfect induction Gate logic networks of Boolean functions and their time behavior Canonical forms two-level and incompletely specified functions Simplification a start at understanding two-level simplification Later automation of simplification multi-level logic time behavior hardware description languages design case studies In chapter 2, we learned the basics for logic functions and its simplification techniques II - Combinational Logic Copyright 24, Gaetano Borriello and Randy H. Katz 55
Possible logic functions of two variables
ombinational logic asic logic oolean algebra, proofs by re-writing, proofs by perfect induction logic functions, truth tables, and switches NOT, ND, OR, NND, NOR, OR,..., minimal set Logic realization
More informationCombinational logic. Possible logic functions of two variables. Minimal set of functions. Cost of different logic functions.
Combinational logic Possible logic functions of two variables Logic functions, truth tables, and switches NOT, ND, OR, NND, NOR, OR,... Minimal set xioms and theorems of oolean algebra Proofs by re-writing
More informationCh 2. Combinational Logic. II - Combinational Logic Contemporary Logic Design 1
Ch 2. Combinational Logic II - Combinational Logic Contemporary Logic Design 1 Combinational logic Define The kind of digital system whose output behavior depends only on the current inputs memoryless:
More informationEECS Variable Logic Functions
EECS150 Section 1 Introduction to Combinational Logic Fall 2001 2-Variable Logic Functions There are 16 possible functions of 2 input variables: in general, there are 2**(2**n) functions of n inputs X
More informationCombinational Logic (mostly review!)
ombinational Logic (mostly review!)! Logic functions, truth tables, and switches " NOT, N, OR, NN, NOR, OR,... " Minimal set! xioms and theorems of oolean algebra " Proofs by re-writing " Proofs by perfect
More informationLecture A: Logic Design and Gates
Lecture A: Logic Design and Gates Syllabus My office hours 9.15-10.35am T,Th or gchoi@ece.tamu.edu 333G WERC Text: Brown and Vranesic Fundamentals of Digital Logic,» Buy it.. Or borrow it» Other book:
More informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and Boolean Algebra) Acknowledgements: Lecture material adapted from Chapter 2 of R. Katz, G. Borriello, Contemporary Logic Design (second edition), Pearson
More informationCombinational Logic. Review of Combinational Logic 1
Combinational Logic! Switches -> Boolean algebra! Representation of Boolean functions! Logic circuit elements - logic gates! Regular logic structures! Timing behavior of combinational logic! HDLs and combinational
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 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 information2009 Spring CS211 Digital Systems & Lab CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS
CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS What will we learn? 2 Logic functions and circuits Boolean Algebra Logic gates and Synthesis CAD tools and VHDL Read Section 2.9 and 2.0 Terminology 3 Digital
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 informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and oolean lgebra) cknowledgements: Materials in this lecture are courtesy of the following people and used with permission. - Randy H. Katz (University of
More informationCombinational logic. Possible logic functions of two variables. Minimal set of functions. Cost of different logic functions
ombinational logic Possible logic functions of two variables asic logic oolean algebra, proofs by re-writing, proofs by perfect induction Logic functions, truth tables, and switches NOT, N, OR, NN,, OR,...,
More informationChapter 2: Switching Algebra and Logic Circuits
Chapter 2: Switching Algebra and Logic Circuits Formal Foundation of Digital Design In 1854 George Boole published An investigation into the Laws of Thoughts Algebraic system with two values 0 and 1 Used
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 informationSwitches: basic element of physical implementations
Combinational logic Switches Basic logic and truth tables Logic functions Boolean algebra Proofs by re-writing and by perfect induction Winter 200 CSE370 - II - Boolean Algebra Switches: basic element
More informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and oolean lgebra) cknowledgements: Lecture material adapted from Chapter 2 of R. Katz, G. orriello, Contemporary Logic Design (second edition), Pearson Education,
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 informationBoolean cubes EECS150. Mapping truth tables onto cubes. Simplification. The Uniting Theorem. Three variable example
EES5 Section 5 Simplification and State Minimization Fall 2 -cube X oolean cubes Visual technique for indentifying when the uniting theorem can be applied n input variables = n-dimensional "cube" Y 2-cube
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 informationSlide Set 3. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary
Slide Set 3 for ENEL 353 Fall 2016 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 2016 SN s ENEL 353 Fall 2016 Slide Set 3 slide
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 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 informationEx: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.
Boolean Expression Forms: Sum-of-products (SOP) Write an AND term for each input combination that produces a 1 output. Write the input variable if its value is 1; write its complement otherwise. OR the
More informationII. COMBINATIONAL LOGIC DESIGN. - algebra defined on a set of 2 elements, {0, 1}, with binary operators multiply (AND), add (OR), and invert (NOT):
ENGI 386 Digital Logic II. COMBINATIONAL LOGIC DESIGN Combinational Logic output of digital system is only dependent on current inputs (i.e., no memory) (a) Boolean Algebra - developed by George Boole
More informationLogic Design. Chapter 2: Introduction to Logic Circuits
Logic Design Chapter 2: Introduction to Logic Circuits Introduction Logic circuits perform operation on digital signal Digital signal: signal values are restricted to a few discrete values Binary logic
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 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 informationCS 121 Digital Logic Design. Chapter 2. Teacher Assistant. Hanin Abdulrahman
CS 121 Digital Logic Design Chapter 2 Teacher Assistant Hanin Abdulrahman 1 2 Outline 2.2 Basic Definitions 2.3 Axiomatic Definition of Boolean Algebra. 2.4 Basic Theorems and Properties 2.5 Boolean Functions
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 informationDigital Logic Circuits - Switching Algebra - Combinational Circuits -
Digital Logic Circuits - Switching Algebra - Combinational Circuits - Dr. Voicu Groza SITE Hall, Room 57 562 58 ext. 259 Groza@EECS.uOttawa.ca Outline Logic Functions Boolean Algebra Logic Functions Minimization
More informationEC-121 Digital Logic Design
EC-121 Digital Logic Design Lecture 2 [Updated on 02-04-18] Boolean Algebra and Logic Gates Dr Hashim Ali Spring 2018 Department of Computer Science and Engineering HITEC University Taxila!1 Overview What
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 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 informationCHAPTER1: Digital Logic Circuits Combination Circuits
CS224: Computer Organization S.KHABET CHAPTER1: Digital Logic Circuits Combination Circuits 1 PRIMITIVE LOGIC GATES Each of our basic operations can be implemented in hardware using a primitive logic gate.
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 informationLecture 2 Review on Digital Logic (Part 1)
Lecture 2 Review on Digital Logic (Part 1) Xuan Silvia Zhang Washington University in St. Louis http://classes.engineering.wustl.edu/ese461/ Grading Engagement 5% Review Quiz 10% Homework 10% Labs 40%
More informationAdministrative Notes. Chapter 2 <9>
Administrative Notes Note: New homework instructions starting with HW03 Homework is due at the beginning of class Homework must be organized, legible (messy is not), and stapled to be graded Chapter 2
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 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 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 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 informationBoolean Algebra and logic gates
Boolean Algebra and logic gates Luis Entrena, Celia López, Mario García, Enrique San Millán Universidad Carlos III de Madrid 1 Outline l Postulates and fundamental properties of Boolean Algebra l 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 informationCombinational Logic Design Principles
Combinational Logic Design Principles Switching algebra Doru Todinca Department of Computers Politehnica University of Timisoara Outline Introduction Switching algebra Axioms of switching algebra Theorems
More informationEECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits)
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) September 5, 2002 John Wawrzynek Fall 2002 EECS150 Lec4-bool1 Page 1, 9/5 9am Outline Review of
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Chapter 2 - Part 1 2 Chapter 2 - Part 1 3 Chapter 2 - Part 1 4 Chapter 2 - Part
More informationOutline. EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) January 30, 2003 John Wawrzynek Outline Review of three representations for combinational logic:
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 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 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 informationChapter 2: Boolean Algebra and Logic Gates
Chapter 2: Boolean Algebra and Logic Gates Mathematical methods that simplify binary logics or circuits rely primarily on Boolean algebra. Boolean algebra: a set of elements, a set of operators, and a
More informationSAMPLE ANSWERS MARKER COPY
Page 1 of 12 School of Computer Science 60-265-01 Computer Architecture and Digital Design Fall 2012 Midterm Examination # 1 Tuesday, October 23, 2012 SAMPLE ANSWERS MARKER COPY Duration of examination:
More informationContents. Chapter 2 Digital Circuits Page 1 of 30
Chapter 2 Digital Circuits Page 1 of 30 Contents Contents... 1 2 Digital Circuits... 2 2.1 Binary Numbers... 2 2.2 Binary Switch... 4 2.3 Basic Logic Operators and Logic Expressions... 5 2.4 Truth Tables...
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 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 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 informationSlides for Lecture 10
Slides for Lecture 10 ENEL 353: Digital Circuits Fall 2013 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 30 September, 2013 ENEL 353
More informationChapter 2 Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates The most common postulates used to formulate various algebraic structures are: 1. Closure. N={1,2,3,4 }, for any a,b N we obtain a unique c N by the operation
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 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 informationCS 226: Digital Logic Design
CS 226: Digital Logic Design 0 1 1 I S 0 1 0 S Department of Computer Science and Engineering, Indian Institute of Technology Bombay. 1 of 29 Objectives In this lecture we will introduce: 1. Logic functions
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 informationECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering Boolean Algebra Boolean Algebra A Boolean algebra is defined with: A set of
More informationUNIVERSITI TENAGA NASIONAL. College of Information Technology
UNIVERSITI TENAGA NASIONAL College of Information Technology BACHELOR OF COMPUTER SCIENCE (HONS.) FINAL EXAMINATION SEMESTER 2 2012/2013 DIGITAL SYSTEMS DESIGN (CSNB163) January 2013 Time allowed: 3 hours
More informationCS/COE0447: Computer Organization and Assembly Language
CS/COE0447: Computer Organization and Assembly Language Logic Design Introduction (Brief?) Appendix B: The Basics of Logic Design Dept. of Computer Science Logic design? Digital hardware is implemented
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 informationEEE130 Digital Electronics I Lecture #4
EEE130 Digital Electronics I Lecture #4 - Boolean Algebra and Logic Simplification - By Dr. Shahrel A. Suandi Topics to be discussed 4-1 Boolean Operations and Expressions 4-2 Laws and Rules of Boolean
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 informationCHAPTER 2 BOOLEAN ALGEBRA
CHAPTER 2 BOOLEAN ALGEBRA This chapter in the book includes: Objectives Study Guide 2.1 Introduction 2.2 Basic Operations 2.3 Boolean Expressions and Truth Tables 2.4 Basic Theorems 2.5 Commutative, Associative,
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 informationFundamentals of Boolean Algebra
UNIT-II 1 Fundamentals of Boolean Algebra Basic Postulates Postulate 1 (Definition): A Boolean algebra is a closed algebraic system containing a set K of two or more elements and the two operators and
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 informationStandard Expression Forms
ThisLecture will cover the following points: Canonical and Standard Forms MinTerms and MaxTerms Digital Logic Families 24 March 2010 Standard Expression Forms Two standard (canonical) expression forms
More informationWorking with Combinational Logic. Design example: 2x2-bit multiplier
Working with ombinational Logic Simplification two-level simplification exploiting don t cares algorithm for simplification Logic realization two-level logic and canonical forms realized with NNs and NORs
More informationSolutions to Assignment No 5 Digital Techniques Fall 2007
Solutions to Assignment No 5 Digital Techniques Fall 2007 André Deutz October 19, 2007 1 Simplifying and Manipulating Boolean Expressions 1. Simplification (a) Simplify each of the following expressions,
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 informationBoolean Algebra & Logic Gates. By : Ali Mustafa
Boolean Algebra & Logic Gates By : Ali Mustafa Digital Logic Gates There are three fundamental logical operations, from which all other functions, no matter how complex, can be derived. These Basic functions
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 informationIf f = ABC + ABC + A B C then f = AB C + A BC + AB C + A BC + A B C
Examples: If f 5 = AB + AB then f 5 = A B + A B = f 10 If f = ABC + ABC + A B C then f = AB C + A BC + AB C + A BC + A B C In terms of a truth table, if f is the sum (OR) of all the minterms with a 1 in
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 informationCPE100: Digital Logic Design I
Chapter 2 Professor Brendan Morris, SEB 326, brendan.morris@unlv.edu http://www.ee.unlv.edu/~bmorris/cpe/ CPE: Digital Logic Design I Section 4: Dr. Morris Combinational Logic Design Chapter 2 Chapter
More informationHardware Design I Chap. 2 Basis of logical circuit, logical expression, and logical function
Hardware Design I Chap. 2 Basis of logical circuit, logical expression, and logical function E-mail: shimada@is.naist.jp Outline Combinational logical circuit Logic gate (logic element) Definition of combinational
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. Overview Part 1 Gate
More informationChapter 2 Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates Huntington Postulates 1. (a) Closure w.r.t. +. (b) Closure w.r.t.. 2. (a) Identity element 0 w.r.t. +. x + 0 = 0 + x = x. (b) Identity element 1 w.r.t.. x 1 =
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 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 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 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 informationChapter-2 BOOLEAN ALGEBRA
Chapter-2 BOOLEAN ALGEBRA Introduction: An algebra that deals with binary number system is called Boolean Algebra. It is very power in designing logic circuits used by the processor of computer system.
More informationDigital Circuit And Logic Design I. Lecture 3
Digital Circuit And Logic Design I Lecture 3 Outline Combinational Logic Design Principles (). Introduction 2. Switching algebra 3. Combinational-circuit analysis 4. Combinational-circuit synthesis Panupong
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 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 informationKP/Worksheets: Propositional Logic, Boolean Algebra and Computer Hardware Page 1 of 8
KP/Worksheets: Propositional Logic, Boolean Algebra and Computer Hardware Page 1 of 8 Q1. What is a Proposition? Q2. What are Simple and Compound Propositions? Q3. What is a Connective? Q4. What are Sentential
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 informationLogic Gate Level. Part 2
Logic Gate Level Part 2 Constructing Boolean expression from First method: write nonparenthesized OR of ANDs Each AND is a 1 in the result column of the truth table Works best for table with relatively
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 informationcontrol in out in out Figure 1. Binary switch: (a) opened or off; (b) closed or on.
Chapter 2 Digital Circuits Page 1 of 18 2. Digital Circuits Our world is an analog world. Measurements that we make of the physical objects around us are never in discrete units but rather in a continuous
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 information