CSCE 211: Digital Logic Design

1. CSCE 211:Digital Logic Design Chin-Tser Huang huangct@cse.sc.edu University of South Carolina

2. Chapter 2: Combinational Systems

3. Objectives • Develop the tools to specify combinational systems • Develop an algebraic approach for the description, simplification, and implementation of combinational systems

4. Continuing Examples CE1. A system with four inputs, A, B, C, and D, and one output, Z, such that Z=1 if three of the inputs are 1. CE2. A single light (that can be on or off) that can be controlled by any one of three switches. One switch is the master on/off switch. If it is off, the lights are off. When the master switch is on, a change in the position of one of the other switches (from up to down or from down to up) will cause the light to change state. CE3. A system to do 1 bit of binary addition. It has three inputs (the 2 bits to be added plus the carry from the next lower order bit) and produces two outputs, a sum bit and a carry to the next higher order position.

5. Continuing Examples CE4.A system that has as its input the code for a decimal digit, and produces as its output the signals to drive a seven-segment display, such as those on most digital watches and numeric displays (more later). CE5. A system with nine inputs, representing two 4-bit binary numbers and a carry input, and one 5-bit output, representing the sum. (Each input number can range from 0 to 15; the output can range from 0 to 31.)

6. Design Process for Combinational Systems Step 1: Represent each of the inputs and output in binary. Step 1.5: If necessary, break the problem into smaller subproblems. Step 2: Formalize the design specification either in the form of a truth table or of an algebraic expression. Step 3: Simplify the description. Step 4: Implement the system with the available components, subject to the design objectives and constraints.

7. Gate • A gate is a network with one output • Gate is the basic component for implementation • For example, an OR gate is shown as follows

8. Don’t Care Conditions • For some input combinations, it doesn’t matter what the output is • Represented as X • Examples of don’t cares • Some input combinations never occur • When one system is designed to drive a second system, some input combination of the first system will make the second system behave the same way

9. Example with Don’t Cares • If for some combination of A, B, C, System Two behaves the same way no matter J is 0 or 1, then J is a don’t care in this case

10. Development of Truth Table • Should be straightforward once the inputs are coded into binary! • The number of inputs determines the number of rows

11. How to Develop Truth Table for CE4?

12. Switching Algebra • Need an algebra to • Obtain the output in terms of the input according to the specification of a network of gates • Simplify the expression • Implement networks of gates

13. Operators of Switching Algebra OR (written as +) a + b (read a OR b) is 1 if and only if a = 1 orb = 1 or both. AND (written as · or simply two variables catenated) a · b = ab (read a AND b) is 1 if and only if a = 1 andb = 1. NOT (written as ´) a´ (read NOT a) is 1 if and only if a = 0. Can you construct the truth table for OR, AND, and NOT?

14. AND, OR, and NOT Gates

15. Basic Properties of Switching Algebra Commutative P1a. a + b = b + aP1b. ab = ba Associative P2a. a +(b+ c) = (a + b) + cP2b.a(bc) = (ab)c This can be generalized: a + b+ c + d + … is 1 if any of the operands is 1 and is 0 only if all are 0 abcd … is 1 if all of the operands are 1 and is 0 only if any is 0

17. Order of Precedence • Without parentheses, order of precedence is NOT AND OR • With parentheses, expressions inside the parentheses are evaluated first

18. Basic Properties of Switching Algebra Identity P3a. a +0 = aP3b.a · 1 = a Null P4a. a +1 = 1 P4b.a · 0 = 0 Complement P5a. a +a´ = 1 P5b.a · a´ = 0 P3aa.0+ a = aP3bb.1 · a = a P4aa.1 + a = 1 P4bb.0 · a = 0 P5aa. a´+a = 1 P5bb.a´ · a = 0

19. Basic Properties of Switching Algebra Idempotency P6a. a +a = aP6b. a ·a = a Involution P7.(a´)´= a Distributive P8a. a (b+ c) = ab + acP8b.a + bc = (a + b)(a + c)

20. Definitions of Terminology A literal is the appearance of a variable or its complement. A product term is one or more literals connected by AND operators. A standard product term, also mintermis a product term that includes each variable of the problem, either uncomplemented or complemented. A sum of productsexpression (often abbreviated SOP) is one or more product terms connected by OR operators. A canonical sum or sum of standard product termsis just a sum of products expression where all of the terms are standard product terms.

21. Definitions of Terminology A minimum sum of productsexpression is one of those SOP expressions for a function that has the fewest number of product terms. If there is more than one expression with the fewest number of terms, then minimum is defined as one or more of those expressions with the fewest number of literals. For example, which of the following equivalent expressions is the minimum SOP expression? (1) x´yz´ + x´yz + xy´z´ + xy´z + xyz 5 terms, 15 literals (2) x´y + xy´ + xyz 3 terms, 7 literals (3) x´y + xy´ + xz 3 terms, 6 literals (4) x´y + xy´ + yz 3 terms, 6 literals

22. Definitions of Terminology A sum term is one or more literals connected by OR operators. A standard sum term, also called a maxterm, is a sum term that includes each variable of the problem, either uncomplemented or complemented. A product of sumsexpression (POS) is one or more sum terms connected by AND operators. A canonical productor product of standard sum terms is just a product of sums expression where all of the terms are standard sum terms.

23. Examples SOP: x´y + xy´ + xyz POS: (x + y´)(x´ + y)(x´ + z´) Both: x´ + y + z or xyz´ Neither: x(w´ + yz) or z´ + wx´y + v(xz + w´)

24. More Properties of Switching Algebra Adjacency P9a. ab+ab´= aP9b.(a + b)(a + b´) = a Simplification P10a. a +a´b= a + bP10b.a(a´ + b) = ab

25. More Properties of Switching Algebra DeMorgan P11a.(a + b)´= a´b´P11b.(ab)´ = a´ + b´ Note that (ab)´ ≠ a´b´ ! DeMorgan can be extended to more than two operands: P11aa.(a + b + c …)´ = a´b´c´… P11bb.(abc…)´ = a´ + b´ + c´ + …

26. From Truth Table to Algebraic Expressions f is 1 if a = 0 AND b = 1 OR if a = 1 AND b = 0 OR if a = 1 AND b = 1 f is 1 if a´ = 1 AND b = 1 OR if a = 1 AND b´ = 1 OR if a = 1 AND b = 1 f is 1 if a´b = 1 OR if ab´ = 1 OR if ab = 1 f = a´b + ab´ + ab

27. From Truth Table to Algebraic Expressions • Can use minterm numbers since the product terms are minterms • Must include variable names if minterm numbers are used • For example, the previous function can be written as f(a, b) = m1 + m2 + m3 f(a, b) = ∑m(1, 2, 3) • If the function includes don’t cares, use a separate ∑ to represent don’t care terms

28. Number of Functions of n Variables

29. Implementation using AND, OR, and NOT Gates f = x’yz’ + x’yz + xy’z’ + xy’z + xyz

30. Implementation using AND, OR, and NOT Gates Can you draw a diagram of circuit for a minimum SOP of the same function, f = x’y + xy’ + xz ? This, and the previous diagram, are two-level circuit

31. Implementation using AND, OR, and NOT Gates Can you draw a diagram of circuit for a minimum POS of the same function, f = (x + y)(x’ + y’ + z) ?

32. Implementing Functions that are not in SOP or POS form h = z’ + wx’y + v(xz + w’)

33. Three More Types of Gates:NAND, NOR, and Exclusive-OR • Why do we use NAND and NOR gates rather than AND, OR, and NOT gates? • Using NAND or NOR is more convenient: need less number of gates • More importantly, NAND and NOR are functionally complete: they can be used to implement AND, OR, and NOT so we need less types of gates! (How?)

34. NAND and NOR Gates

35. Use NAND to Implement AND, OR, and NOT

36. Implementation using NAND

37. Exclusive-OR and Exclusive-NOR Gates

38. Useful Properties of Exclusive-OR

39. Simplification of Algebraic Expression Primary tools: P9a. ab+ab´ = aP9b.(a+b)(a +b´) = a P10a. a +a´b= a + bP10b.a(a´+ b) = ab Other useful properties: P6a. a +a = aP6b. a ·a = a P8a. a (b+ c) = ab + acP8b.a + bc = (a+ b)(a + c) Another useful property when the function is not in SOP or POS form: Absorption P12a. a +ab= aP12b.a(a + b) = a

40. Simplification Examples • Can you simplify (1) to each of (2), (3), and (4)? (1) x´yz´ + x´yz + xy´z´ + xy´z + xyz (2) x´y + xy´ + xyz (3) x´y + xy´ + xz (4) x´y + xy´ + yz

41. Simplification Examples • Can you simplify the following functions? xyz + x’y + x’y’ = ? wx + wxy + w’yz + w’y’z + w’xyz’ = ?

42. Consensus • Denoted as ¢ • For any two product terms where exactly one variable appears uncomplemented in one and complemented in the other, the consensus is defined as the product of the remaining literals. If no such variable exists or if more than one such variable exists, then the consensus us undefined. If we write one term as at1 and the second as a’t2 (where t1 and t2 represent product terms), then, if the consensus is defined, at1¢ a’t2 = t1t2

43. Consensus Property Consensus P13a.at1 + a´t2 + t1t2 = at1 + a´t2 P13b. (a + t1)(a´ + t2)(t1 + t2)= (a + t1)(a´ + t2)

44. Simplification with Consensus • Can you simplify the following functions? bc’ + abd + acd = ? c’d’ + ac’ + ad + bd’ + ab = ?

45. Convert SOP to Sum of Minterms • Two approaches • By developing a truth table • By using P9a. (adjacency) to add variables to a term • To convert POS to product of maxterms, use P9b.

46. Examples • Can you convert the following SOP to sum of minterms? • Can you convert the following POS to product of maxterms? bc’ + ab’c + a’b = ? (a + b’ + c)(a’ + c’ ) = ?

47. Convert between SOP and POS • POSSOP: Use the following 3 properties (in this order) P8b.a + bc = (a+ b)(a + c) P14a. ab + a’c = (a + c)(a’ + b) P8a. a (b+ c) = ab + ac • SOPPOS: Reverse the order (w + x’ + y)(w + x + z)(w’ + y’ + z) = ? wxy’ + xyz + w’x’z’ = ?