SUBCOURSE IT 0346

EDITION A

US ARMY INTELLIGENCE CENTER BOOLEAN APPLICATION

BOOLEAN APPLICATION Subcourse Number IT 0346 EDITION A U.S. ARMY INTELLIGENCE CENTER FORT HUACHUCA, AZ 85613-6000 5 Credit Hours Edition Date: March 1997 SUBCOURSE OVERVIEW This subcourse is designed to teach the application of Boolean Algebra. You will use skills and knowledge taught in IT 0342, IT 0343, IT 0344, and IT 0345. If you notice any difficulty during this course, review the preceding subcourses before continuing. Subcourses IT 0342, IT 0343, IT 0344, and IT 0345 are prerequisites for this subcourse. This lesson replaces SA 0716. TERMINAL LEARNING OBJECTIVE ACTION: Select the indicated function when a switch is closed, select the Boolean function of presented drawings, simplify Boolean expressions using the laws of Boolean Algebra, select the number of possible truth combinations for a given Boolean expression, select a correctly completed truth table, identify equivalent expressions, derive a minterm expression from the sum-output column of a truth table, select the minterm expression derived from the carry-output column of a truth table, choose the simplified Boolean expression derived from a Veitch diagram, select the expression equal to given logic diagrams, and complete a statement indicating the first step involved in designing logic circuits. Given a diagram of a switch, a Boolean expression with up to eight variables, Veitch diagrams, logic drawings, truth tables, or written statements.

CONDITION:

IT 0346

TABLE OF CONTENTS Section Subcourse Overview Lesson: Boolean Application Page i 1-1

IT 0346

ii

LESSON BOOLEAN APPLICATION OVERVIEW LESSON DESCRIPTION: This subcourse is designed to teach the application of Boolean Algebra. You will use the skills and knowledge taught in IT0342, IT 0343, IT 0344, and IT 0345. If you notice any difficulty during this course, review the preceding subcourses before continuing. TERMINAL LEARNING OBJECTIVE ACTION: Select the indicated function when a switch is closed, select the Boolean function of presented drawings, simplify Boolean expressions using the laws of Boolean Algebra, select the number of possible truth combinations for a given Boolean expression, select a correctly completed truth table, identify equivalent expressions, derive a minterm expression from the sum-output column of a truth table, select the minterm expression derived from the carry-output column of a truth table, choose the simplified Boolean expression derived from a Veitch diagram, select the expression equal to given logic diagrams, and complete a statement indicating the first step involved in designing logic circuits. Given a diagram of a switch, a Boolean expression with up to eight variables, Veitch diagrams, logic drawings, truth tables, or written statements.

CONDITION:

1-1

IT 0346

1. A digital computer uses bistable circuits as electronic switches. These electronic switches are put in a definite order to perform certain prescribed tasks, such as adding, comparing, etc. When designing switching circuits for the first digital computers, it became evident that a simple mathematical way of representing switching circuits was needed so that these circuits could be simplified. It was found that Boolean algebra could be used to represent and to simplify these electronic switching circuits. Boolean algebra is used to ___________________ and to ___________________ electronic switching circuits. 2. Since Boolean algebra is based upon elements having two possible conditions, or states, it is readily adaptable to electronic switching circuits. A switching circuit can be in only one of two possible conditions at any given instant: it is either open, or it is closed. Using Boolean notation, a switch which may be open or closed is represented by a variable, such as A, A, B, B, L, L, etc. To avoid confusion in this program, the labeling of a switch will indicate the function of the switch when closed.

IT 0346

1-2

1. represent simplify

2.

(Continued) For example: when the switch is closed. indicates function _______________________ is present when the switch is ________________. indicates function A is present

3.

Select two reasons for using Boolean algebra with digitalcomputer electronic switching circuits. a. To simplify electronic switching circuits. b. To perform more complex mathematical operations. c. To create more complex switching circuits. d. To decrease the ease of designing electronic switching circuits. e. To represent electronic switching circuits.

4.

A switch can be in only one of two possible states at any given instant: either open or closed. If variable C is used to indicate the function present when a given switch is closed, the opposite function, C, would be present when that switch is open. For example: indicates function X is present

when the switch is closed; when the switch is open, the opposite function, X, is present. indicates function ________________ is present when the switch is closed; when the switch is open, function ________________ is present.

1-3

IT 0346

2. B closed

5. What function is present when each of the following switches is closed? a. b. c. d. e. f.

3. a. e.

6. Several fundamental switching networks are shown below with their appropriate Boolean notations. The variable (A, B, C --etc.) representing each switch indicates the function is present when that switch is closed. Assuming each switching network is part of a complete circuit, the Boolean notation is as follows:

4. D

a.

f.

b. c.

d.

e.

IT 0346

1-4

5. a. P b. X c. U d. 9 e. D f. 5

6. (Continued) In example c, the result of switching function AB will allow current to flow only when both A and B are closed. In example d, the result of switching function K + L will allow current flow when either K or L is closed.

Match the switching networks in column A with the appropriate Boolean notation in column B. A B a. (W+X) Y (1) b. W+Y c. WX (2) d. W e. X(W+Y)

(3)

f. (W+X)(W+Y) g. W+X

(4)

(5)

1-5

IT 0346

6. (1) d. (2) c. (3) b.

7. What function is present when each of the following switches is open?

a. (4) a. b. (5) e. c.

d.

e.

f.

8. State the two reasons for using Boolean algebra with digitalcomputer electronic switching circuits. (1) (2) 9. A switching network may contain a number of switches represented by the same variable. When the function of a variable is present, the function is present for every switch represented by that same variable. For example:

The switching network above contains two switches represented by variable A. When function A is present, both switches represented by variable A will be closed.

IT 0346

1-6

7. a. W b. Q c. L d, U e. 8 f. 4 8. To represent electronic switching circuits. To simplify electronic switching circuits.

9. (Continued) A switching network which contains four switches represented by variable C will have __________________ switches closed when function C is present.

10. The figure below represents a switching network which contains four individual switches. Notice that two of the switches are represented by the same variable, X.

When the function of variable X is present for this network, __________________________ represented by variable X will (both switches/only one switch) be ______________. (closed/open) 11. A Boolean expression can be written for switching circuits after first determining which combination of switches must be caused to obtain an output. For example, the AND circuit of two switches (variables) is shown below.

1-7

IT 0346

9. four

11. (Continued) Switch A or switch B may be either open or closed (O or 1

10. both switches closed

position). The series circuit will provide an output only if both A and B are closed; i.e., equal to 1. If either switch A or switch B is open (i.e., equal to 0), then the circuit will not provide an output. The Boolean expression representing this switching circuit is AB. Assuming there is a complete circuit for each of the following switching circuits, the Boolean expressions representing the output would be

IT 0346

1-8

11. (Continued)

Write Boolean expressions for the following switching circuits:

a.

b.

c.

d.

e.

1-9

IT 0346

11. a. (LM+N) P b. (A+B)(CA) (D+B) c. CX+X

12. Match each of the switching networks in column A with the appropriate Boolean expression in column B. A (1) B a. (D+B) E b. D+D+E

d. (A+B+C)(DE) (F+G+HI+JKL)

c. D+E e. EAS+Y (2) d. DE

(3)

(4)

13. TEST FRAME What function is present when each of the following switches is closed?

a.

e.

b.

f.

c.

g.

d.

IT 0346

1-10

12. (1) d. (2) c. (3) a. (4) b.

14. One of the applications of Boolean algebra is the simplification of switching networks. For example, the switching network shown below can be simplified to a circuit consisting of only one switch which performs the same function.

13. a. B b. O c. O d. L e. E f. A g. N

The switching network shown above is simplified as follows: Step 1. Write the Boolean expression for the network. A + AB Step 2. Simplify the expression, using the basic laws of Boolean algebra. A + AB = original expression A = result of absorption (A + AB = A) Step 3. Draw the switching network which represents the simplified expression.

1-11

IT 0346

14. (Continued) The original switching network, consisting of three switches, has been simplified to one switch which performs the same function. Simplify the switching network below, using the basic laws of Boolean algebra. Draw the simplified circuit.

SOLUTION TO FRAME 14: Step 1. D +DE Step 2. D + DE = original expression D = result of absorption (D + DE = D) D = simplified expression Step 3.

IT 0346

1-12

15. Write the Boolean expressions for the following switching circuits: a.

b.

c.

16. What function is present when each of the following switches is open?

a.

d.

b.

e.

c.

f.

1-13

IT 0346

15. a. A(B+C+D) E b. (F+G+H+J) (KL)(M+N +OP+QR) c. (S+T+U)(VW) (X+YZ) 16. a. 2 b. G

17. Simplify the switching circuit below, using the basic laws of Boolean algebra. Draw the simplified circuit.

18. Match each of the switching networks in column A with the appropriate Boolean expression in column B. A B

c. F (1) d. 6 e. K f. E (2)

a. ABC b. A(B+C) c. JK(M+N)

d. J+K+M+N

(3)

(4)

IT 0346

1-14

17.

19. Write the Boolean expressions for the following switching circuits:

a.

b.

18. c. (1) c. (2) a. (3) d. d.

(4) b.

20. Simplify the switching circuit below, using the basic law of

Boolean algebra. Draw the simplified circuit.

1-15

IT 0346

19. a. (A+B+C) D b. (EF) +G c. (H+J) K(L+M) d. N+(OPQ)

21. The objective of using Boolean algebra in digital-computer study is to determine the 'truth value' of a combination of two or more statements. For any Boolean function, there is a corresponding truth table, which shows in tabulated form the true condition of the function for each occasion in which conditions can be assigned to its variables. In binary Boolean algebra, 0 and 1 are the symbols assigned to the variables of any function. The objective of using Boolean algebra in digital-computer study is to determine the ______________________________ of the combination of two or more statements.

20

22. In designing logic circuits for a computer, the first step is to construct a truth table. The truth table not only provides a ready reference for use in analyzing the operating theory of the circuit, but also is useful in developing the overall signalflow diagram. The first step in designing logic circuits for computers is to construct a ___________________________________.

IT 0346

1-16

21. truth value

23. The objective of using Boolean algebra in digital-computer study is to determine the________________________________________ of the combination of ____________________ or ____________________ statements.

22. truth table

24. The number of possible truth combinations of a given number (n) of binary variables is 2n. 2 binary variables = 2n = 22 = 4 combinations 3 binary variables = 2n = 23 = 8 combinations 4 binary variables = 2n = 24 = 16 combinations To construct a truth table for the Boolean expression AB will require 22, or 4, rows--one row for each truth combination, as indicated below. A 0 0 1 1 B 0 1 0 1 AB 0 0 0 1

How many possible truth combinations are there for the following Boolean expressions? a. DE b. NREV c. L+A d. N+A+D e. EZ+RA f. NAVY

1-17

IT 0346

23. truth value two more 24. a. 22= 4 b. 24 = 16 c. 22 = 4 d. 23 = 8 e. 24 = 16 f. 24 = 16

25. The first step in designing logic circuits for computers is to ____________________ a ____________________ ______________________. 26. Write the number of possible truth combinations for the following Boolean expressions: a. (A+B+C) D b. (EF) +G c. N+OP+QR d. U+V

27. What is the objective of using Boolean algebra in digitalcomputer study?

28. What is the first step when designing logic circuits for digital computers?

IT 0346

1-18

25. construct truth table

29. Write the number of possible truth combinations for the following Boolean expressions: a. SO+ON b. W+E c. WILL d. B+E e. D+ONE

26. a. 24 = 16 b. 23 = 8 c. 25 = 32 d. 22 = 4 27. To determine the truth value of the

30. Assume a problem is presented that requires the design of a circuit which will add two binary digits. The first step is to construct a truth table which includes an output for each combination of possible input states. From the rules for binary addition, a truth table is derived as shown below. 0 + 0 = 0 with a carry of 0 + 1 = 1 with a carry of 1 + 0 = 1 with a carry of 1 + 1 = 0 with a carry of INPUTS 0 0 0 1 Rules for binary addition

OUTPUT SUM 0 1 1 0 CARRY 0 0 0 1 Truth table derived from the rules for binary addition

combination of two or more statements. 28. construct Construct a truth table for a circuit that will add two binary truth table digits. Label the inputs C and D. Show the SUM and the CARRY outputs. A 0 0 1 1 B 0 1 0 1

1-19

IT 0346

29. a. 23=8 b. 22=4

31. The truth table provides a simple means for testing the logical equivalence of two or more Boolean expressions. To test the logical equivalence of two expressions, construct a truth table for both expressions. If both expressions have the

c. 23 = 8 d. 2 = 4
2

same truth value for each case (row) in the truth table, the expressions are equivalent and can be substituted for each other. For example: Prove that A+AB=A.

e. 24 =16

A 0 0 1 1

B 0 1 0 1

AB 0 0 0 1

A+AB 0 0 1 1

A+AB=A 1 1 1 1

The third column in the truth table above represents the 30 logical product (AB) for two variables. The fourth column
INPUTS C 0 0 1 1 0 1 0 1 OUTPUTS D SUM CARRY 0 1 1 0 0 0 0 1

represents the logical product and sum (A+AB) of two variables. A "1" is placed in this column when either the A column or the AB column or both have a truth value of 1. The fifth column is a comparison of the first column (A) and the fourth column (A+AB). A 1 is placed in this column whenever the truth value of the two columns is the same; i.e., both 0 or both 1.

IT 0346

1-20

31. (Continued) Since the final column results in all 1's, the expression A+AB = A is proved equivalent in all cases. a. Complete the following truth table: A 0 0 1 1 B 0 1 0 1 A+B 0 1 1 1 A(A+B) 0 0 1 1 A(A+B) =A

b. The expression A(A+B) = A ______________ (is/is not) equivalent. 32. Construct a truth table which will add two binary digits. Label the inputs E and F. Show both the SUM and the CARRY outputs. INPUTS OUTPUTS SUM CARRY

1-21

IT 0346

31. a. A(A+B) = A 1 1 1 b. is

33. For a function to be performed, a MINTERM EXPRESSION can be derived for each output column from a truth table. One output column is taken at a time, and a Boolean product is written for each output condition that is a 1. After the Boolean product which represents each 1 output is written, the outputs are ORed together to form a MINTERM EXPRESSION. For example, the diagram below is the truth table for a circuit that will add two binary digits. INPUTS A B 0 0 0 1 1 0 1 1 SUM 0 1 1 0 OUTPUT CARRY 0 0 0 1

32
E F SUM CARRY

To derive a MINTERM EXPRESSION for each output column, the Boolean product is written for each 1 output. Use only one output column at a time. The Boolean product for the SUM-output column is derived as follows: The first 1 occurs when A is 0 and B is 1; thus, the Boolean product for this condition is AB. The next 1 occurs when A is 1 and B is 0; thus, the Boolean product for this condition is AB.

0 0 1 1

0 1 0 1

0 1 1 0

0 0 0 1

IT 0346

1-22

33. (Continued) Either Boolean product results in a 1 output. The sum-output column MINTERM EXPRESSION becomes AB+AB by combining the two Boolean products using the OR operation. Derive a minterm expression for the 1 output in the CARRYoutput column of the truth table below. INPUTS A 0 0 1 1 B 0 1 0 1 SUM 0 1 1 0 OUTPUT CARRY 0 0 0 1

34. Complete the truth table below. a. X 0 0 1 1 Y 0 1 0 1 X+Y 0 1 1 1 X(X+Y) 0 0 1 1 X(X+Y) =X

b. Is the expression X(X+Y) =X equivalent in all cases?

1-23

IT 0346

33. AB Solution: A 1 output occurs in the CARRY column when A is 1 and B is 1; thus, the Boolean product for this condition is AB.

35. The truth table below represents a circuit which will be encountered in digital computers. Notice, there are three binary variables, A, B, and K. The possible truth combinations are 2n = 23 = 8, as shown. A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 K 0 1 0 1 0 1 0 1 SUM 0 1 1 0 1 0 0 1 CARRY 0 0 0 1 0 1 1 1

34.

To derive a minterm expression for the SUM-output column, first write the Boolean product for each output which is a 1

a. X(X+Y) =X 1 1 1 1 b. Yes.

in the SUM column. After the Boolean product is written for each 1 output, the outputs are ORed together to form a minterm expression. The SUM-output minterm expression derived from the truth table above is ABK + ABK + ABK + ABK Derive the minterm expression from the CARRY output of the truth table above.

IT 0346

1-24

35. ABK + ABK + ABK + ABK

36. Derive a minterm expression from the SUM-output column of the truth table below. A 0 0 1 1 INPUTS B 0 1 0 1 OUTPUTS SUM CARRY 0 0 1 0 1 0 0 1

37. Construct a truth table for adding two binary digits. Label the inputs A and B. Show both the SUM and the CARRY outputs. INPUTS OUTPUTS

1-25

IT 0346

36. AB+AB

38. Minterm expressions which have been derived from a truth table may not always be in the simplest form. If the minterm expressions are plotted on a Veitch diagram, a simplified expression may be extracted. The SUM and the CARRY output minterm expressions are plotted on the Veitch diagrams below. A SUM=ABK+ABK+ABK+ABK B B X X K A X K A X X K X K K A X

37
E F SUM CARRY

CARRY=ABK+ABK+ABK+ABK

B B

X K

Investigation reveals the expression extracted from the SUM Veitch diagram is exactly the same as the expression is in the simplest form.

Extract the simplified expression from the Veitch diagram of the CARRY function.

IT 0346

1-26

38. AB + BK +AK

39. Derive a minterm expression from the SUM-output column of the truth table below. A 0 0 0 0 1 1 1 1 INPUTS B 0 0 1 1 0 0 1 1 K 0 1 0 1 0 1 0 1 SUM 0 1 1 0 1 0 0 1 OUTPUT CARRY 0 0 0 1 0 1 1 1

40. Complete the truth table below. a. X 0 0 1 1 Y 0 1 0 1 X+Y 0 1 1 1 X(X+Y) 0 0 1 1 X(X+Y) = X

b. Is the expression X(X+Y) =X equivalent in all cases?

1-27

IT 0346

39. ABK + ABK + ABK + ABK

41. After a simplified expression has been extracted from a Veitch diagram, the final step in designing logic circuits, using Boolean algebra, is to draw the appropriate logic diagram to represent the simplified expression. The sum expression and the carry expression for a circuit which will add two binary digits are AB + AB SUM EXPRESSION AB CARRY EXPRESSION

Since there are two outputs consisting of (1) the sum output and (2) the carry output, the logic diagram must show two outputs when completed. 40. a. X(X+Y) =X 1 1 1 b. Yes To diagram the sum output, first recognize the expression AB + AB as an overall two-input OR circuit containing inputs AB and AB. The first step in drawing the logic diagram is shown below.

Diagram each input and draw the appropriate logic symbols as follows:

IT 0346

1-28

41. (Continued) To diagram the carry function (AB) of the circuit, simply tie inputs A and B into an AND-logic symbol and indicate the carry function as follows:

Draw the logic diagram for the following expressions which describe a circuit that will add two binary digits. Label the two outputs. DE + DE = SUM OUTPUT DE = CARRY OUTPUT

1-29

IT 0346

SOLUTION TO FRAME 41:

42. Extract a simplified Boolean expression from the Veitch diagram below. R T T Z X X Z Z R X

43. Derive a minterm expression from the SUM-output column of the truth table below. A 0 0 1 1 B 0 1 0 1 SUM 0 1 1 0 CARRY 0 0 0 1

IT 0346

1-30

42. RTZ+RT

44. The Boolean expressions below describe a circuit which will add two binary digits. Draw the logic diagram for the circuit and label each output. AB + AB = SUM AB = CARRY

43. AB+AB

1-31

IT 0346

SOLUTION TO FRAME 44:

45. Derive a minterm expression from the CARRY-output column of the truth table below. A 0 0 0 0 1 1 1 1 INPUTS B 0 0 1 1 0 0 1 1 K 0 1 0 1 0 1 0 1 SUM 0 1 1 0 1 0 0 1 OUTPUT CARRY 0 0 0 1 0 1 1 1

46. Extract a simplified Boolean expression from the Veitch diagram below. D F F X J J X X J D

IT 0346

1-32

45. ABK + ABK + ABK + ABK

47. The Boolean expressions below describe a circuit which will add two binary digits. Draw the logic diagram for the circuit and label each output. CL + CL = SUM CL = CARRY

46. DFJ + DJ

1-33

IT 0346

SOLUTION TO FRAME 47:

IT 0346

1-34