1. Boolean Algebra and Combinational Logic
Chapter 3
Boolean Algebra and Combinational Logic

2. Chapter 3 Homework
3.2a, 3.3a, 3.5, 3.7, 3.11h, 1.13,
3.19, 3.21a&f, 3.23b, 3.35, 3.43, 3.45, 3.47, 3.63

3. Logic Gate Network Two or more logic gates connected together.
Described by truth table, logic diagram, or Boolean expression.

4. Logic Gate Network = +

5. Boolean Expression for Logic Gate Network
Similar to finding the expression for a single gate.
Inputs may be compound expressions that represent outputs from previous gates.

6. Boolean Expression for Logic Gate Network= +

7. Boolean Expression for Logic Gate Network= + + +

8. Bubble-to-Bubble Convention
Choose gate symbols so that outputs with bubbles connect to inputs with bubbles.
Results in a cleaner notation and a clearer idea of the circuit function.

9. Bubble-to-Bubble Convention – Step 1
Start at the output and work towards the input.
Select the OR gate as the last gate for an SOP solution.
Select the AND gate as the last gate for an POS solution.

10. Bubble-to-Bubble Convention – Step 2
Choose the active level of the output if necessary.
Go back to the circuits inputs to the next level of gating.

11. Bubble-to-Bubble Convention – Step 3
Match the output of these gates to the input of the final gate. This may require converting the gate to its DeMorgan’s equivalent.
Repeat Step 2 until you reach the circuits.

12. Bubble-to-Bubble Convention – Step 3=

13. Bubble-to-Bubble Convention – Step 3=
Y =

14. Order of Precedence
Unless otherwise specified, in Boolean expressions AND functions are performed first, followed by ORs.
To change the order of precedence, use parentheses.

15. Order of Precedence + + + + + + +

16. Simplification by Double Inversion
When two bubbles touch, they cancel out.
In Boolean expressions, bars of the same length cancel.

17. Logic Diagrams from Boolean Expressions
Use order of precedence.
A bar over a group of variables is the same as having those variables in parentheses.

18. Logic Diagrams from Boolean Expressions= + + = + +

19. Truth Tables from Logic Diagrams or Boolean Expressions
Two methods:
Combine individual truth tables from each gate into a final output truth table.
Develop a Boolean expression and use it to fill in the truth table.

20. Truth Tables from Logic Diagrams or Boolean Expressions+

21. Truth Tables from Logic Diagrams or Boolean Expressions

22. Circuit Description Using Boolean Expressions
Product term:
Part of a Boolean expression where one or more true or complement variables are ANDed.
Sum term:
Part of a Boolean expression where one or more true or complement variables are ORed.

23. Circuit Description Using Boolean Expressions
Sum-of-products (SOP):
A Boolean expression where several product terms are summed (ORed) together.
Product-of-sum (POS):
A Boolean expression where several sum terms are multiplied (ANDed) together.

24. Examples of SOP and POS Expressions

25. SOP and POS Utility
SOP and POS formats are used to present a summary of the circuit operation.

26. Bus Form
A schematic convention in which each variable is available, in true or complement form, at any point along a conductor.

27. Bus Form

28. Deriving a SOP Expression from a Truth Table
Each line of the truth table with a 1 (HIGH) output represents a product term.
Each product term is summed (ORed).

29. Deriving a POS Expression from a Truth Table
Each line of the truth table with a 0 (LOW) output represents a sum term.
The sum terms are multiplied (ANDed).

30. Deriving a POS Expression from a Truth Table

31. Table 3.7 SOP ABCD ABCD ABCD ABCD ABCD ABCD ABCD ABCD POS _ _ _ _ _ _+
ABCD +
ABCD +
ABCD +
ABCD +
ABCD +
ABCD +
ABCD
POS _ _ _ _ _ _
(A + B + C + D)
(A + B + C + D)
(A + B + C + D)
(A + B + C + D) _ _ _ _ _ _ _ _ _ _ _ _
(A + B + C + D)
(A + B + C + D)
(A + B + C + D)
(A + B + C + D)

32. Theorems of Boolean Algebra
Used to minimize a Boolean expression to reduce the number of logic gates in a network.
24 theorems.

33. Commutative Property
The operation can be applied in any order with no effect on the result.
Theorem 1: xy = yx
Theorem 2: x + y = y + x

34. Associative Property
The operands can be grouped in any order with no effect on the result.
Theorem 3: (xy)z = x(yz) = (xz)y
Theorem 4: (x + y) + z = x + (y + z) = (x + z) + y

35. Distributive Property
Allows distribution (multiplying through) of AND across several OR functions.
Theorem 5: x(y + z) = xy + xz
Theorem 6: (x + y)(w + z) = xw + xz + yw + yz

36. Distributive Property

37. Operations with Logic 0 Theorem 7: x  0 = 0 Theorem 8: x + 0 = x

38. Theorem 7: x  0 = 0

39. Theorem 8: x + 0 = x

40. Theorem 9: x  0 = x

41. Operations with Logic 1
Theorem 10: x  1 = x
Theorem 11: x + 1 = 1

42. Theorem 10: x  1 = x

43. Theorem 11: x + 1 = 1

45. Operations with Logic 0 & 1

46. Operations with the Same Variable
Theorem 13: x  x = x
Theorem 14: x + x = x
Theorem 15: x  x = 0

47. Theorem 13: x  x = x

48. Theorem 14: x + x = x

49. Theorem 15: x  x = 0

50. Operations with the Complement of a Variable

51. Theorem 16: x  x = 0 _

52. Theorem 17: x + x = 1 _

53. Theorem 18: x  x = 1 _

54. Operations with the Same Variable & Complement of a Variable

55. Double Inversion _ _ _ X X X
= X

56. DeMorgan’s Theorem

57. Multivariable Theorems
Theorem 22: x + xy = x
Theorem 23: (x + y)(x + y) = x + yz

58. Theorem 22: x + xy = x x
X + xy = x XY y

59. Theorem 23: (x + y)(x + y) = x + yz
(x + y)(x + z) z
x + z x
x + yz y yz z

61. Simplifying SOP and POS Expressions
A Boolean expression can be simplified by:
Applying the Boolean Theorems to the expression
Application of graphical tool called a Karnaugh map (K-map) to the expression

62. Simplifying an Expression

63. Simplifying an Expression

64. Simplification By Karnaugh Mapping
A Karnaugh map, called a K-map, is a graphical tool used for simplifying Boolean expressions.

65. Construction of a Karnaugh Map
Square or rectangle divided into cells.
Each cell represents a line in the truth table.
Cell contents are the value of the output variable on that line of the truth table.

66. Construction of a Karnaugh Map

67. Construction of a Karnaugh Map

68. Construction of a Karnaugh Map

69. K-map Cell Coordinates
Adjacent cells differ by only one variable.
Grouping adjacent cells allows canceling variables in their true and complement forms.

70. Loading a K-Map from a Truth Table
Each cell of the K-map represents one line from the truth table.
The K-map is not laid out in the same order as the truth table.

71. Loading a K-Map from a Truth Table

72. Grouping Cells along the Outside Edge

73. Loading a K-Map from a Truth Table

74. Grouping Cells Cells can be grouped as pairs, quads, and octets.
A pair cancels one variable.
A quad cancels two variables.
An octet cancels three variables.

75. Grouping Cells
Y = A’B’ + A’B
Keep: A’
Discord: A, B, & B’
Y = A’

76. Grouping Cells Y = A’B’C + A’BC + ABC + AB’C Discord: A, A’, B, &B’
Keep: C
Y = C

77. Grouping Cells Y = A’BC’D’ + A’BC’D + A’BCD + A’BCD’ +
Discard:
A, C & D
Keep: B
Y = B

78. Grouping Cells along the Outside Edge
The cells along an outside edge are adjacent to cells along the opposite edge.
In a four-variable map, the four corner cells are adjacent.

79. Multiple Groups Each group is a term in the maximum SOP expression.
A cell may be grouped more than once as long as every group has at least one cell that does not belong to any other group. Otherwise, redundant terms will result.

80. Multiple Groups

81. Maximum Simplification
Achieved if the circled group of cells on the K-map are as large as possible.
There are as few groups as possible.

82. Maximum Simplification
Keep: B’ & D
Y = B’ + D

83. Using K-Maps for Partially Simplified Circuits
Fill in the K-map from the existing product terms.
Each product term that is not a minterm will represent more than one cell.
Once completed, regroup the K-map for maximum simplification.

84. Using K-Maps for Partially Simplified Circuits

85. Using K-Maps for Partially Simplified Circuits

86. Don’t Care States
The output state of a circuit for a combination of inputs that will never occur.
Shown in a K-map as an “x”.

87. Value of Don’t Care States
In a K-map, set “x” to a 0 or a 1, depending on which case will yield the maximum simplification.

88. Value of Don’t Care States

89. POS Simplification Using Karnaugh Mapping
Group those cells with values of 0.
Use the complements of the cell coordinates as the sum term.

90. POS Simplification Using Karnaugh Mapping

91. Universality of NAND/NOR Gates
Any logic gate can be implemented using only NAND or only NOR gates.

92. NOT from NAND
An inverter can be constructed from a single NAND gate by connecting both inputs together.

93. NOT from NAND

94. AND from NAND
The AND gate is created by inverting the output of the NAND gate.

95. AND from NAND

96. OR and NOR from NAND

97. OR from NAND

98. NOR from NAND

99. NOT from NOR
An inverter can be constructed from a single NOR gate by connecting both inputs together.

100. NOT from NOR

101. OR from NOR
The OR gate is created by inverting the output of the NOR gate.

102. OR from NOR

103. AND and NAND from NOR

104. AND from NOR

105. NAND from NOR

106. Practical Circuit Implementation in SSI
Not all gates are available in TTL.
TTL components are becoming more difficult to find.
In a circuit design, it may be necessary to replace gates with other types of gates in order to achieve the final design.

107. Pulsed Operation
The enabling and inhibiting properties of the basic gates are used to pass or block pulsed digital signals.
The pulsed signal is applied to one input.
One input is used to control (enable/inhibit) the pulsed digital signal.

108. Pulsed Operation

109. Pulsed Operation

110. General Approach to Logic Circuit Design – 1
Have an accurate description of the problem.
Understand the effects of all inputs on all outputs.
Make sure all combinations have been accounted for.

111. General Approach to Logic Circuit Design – 2
Active levels as well as the constraints on all inputs and outputs should be specified.
Each output of the circuit should be described either verbally or with a truth table.

112. General Approach to Logic Circuit Design – 3
Look for keywords AND, OR, NOT that can be translated into a Boolean expression.
Use Boolean algebra or K-maps to simplify expressions or truth tables.