Courses In Electrical Engineering

Volume II DIGITAL ELECTRONICS CHAPTER THREE : BOOLEAN ALGEBRA

By J-P. NGOUNE DIPET I (Electrotechnics), DIPET II (Electrotechnics) DEA (Electrical Engineering) Teacher in the Electrical Department, GTHS KUMBO, Cameroon.

Digital Electronics_Jean-Paul NGOUNE

Chapter Three

BOOLEAN ALGEBRA
3.0 Specific objectives: At the end of this chapter, the student will be able to: Master the rules of Boolean arithmetic; Master Boolean algebraic identities and properties; Convert truth tables of logic circuits into Boolean expressions.

3.1 Introduction: The Boolean algebra was created by the English mathematician George Boole (1815-1864). The Boolean algebra codifies rules of relationship between

mathematical quantities to one of two possible values: true or false, 1 or 0. So, all arithmetic operations performed with Boolean quantities have but one of two possible outcomes: either 1 or 0. There are three basic Boolean arithmetic operations: Boolean addition which is equivalent to the OR logic function, as well as parallel switch contacts; Boolean multiplication, which is equivalent to the AND function as well as series switch contacts; Boolean complementation which is equivalent to the NOT logic function.

3.2 Boolean arithmetic: This section presents the basic relationship concerning the three basic Boolean arithmetic operations. 3.2.1 Boolean addition: As we have already said, Boolean addition is equivalent to the OR logic function. Therefore, we have the following relationships: 0+0=0 0+1=1 1+0=1 1+1=1
Digital Electronics_Jean-Paul NGOUNE

0+0=0
0 0 0

0 0

0+1=1
U1

0 1 1

0 1

1+0=1
U2

1 1 0

1 0

1+1=1
U3

1 1 1

1 1

Remark 3.1: There is a difference between Boolean addition and binary addition; for binary addition we have the following relationships. 0+0=0 0+1=1 1+0=1 1 + 1 = 10 (1 + 1 = 0 + report of 1).

3.2.2 Boolean multiplication: The Boolean multiplication is equivalent to the AND logic function: 0x0=0 0x1=0 1x0=0 1x1=1

Digital Electronics_Jean-Paul NGOUNE

0x0=0
0 0 0 0 0 0

0x1=0
0 1 0 0 1

1x0=0
1 0 0 1 0 0

1x1=1
1 1 1 1 1 1

3.2.3 Boolean complementation: The Boolean complementation is equivalent to the NOT logic function.
/0 = 1
0 1

/1 = 0

3.3 Boolean algebraic identities: An identity is a statement that is true for all possible values of its variables. There are two groups of Boolean algebraic identities: additive identities and multiplicative identities. 3.3.1 Additive identities If A is a Boolean variable, then the following statements are always true. A+0=A A+1=1 A+A=A A + /A = 1
A+0=A A 0 A 0 A A

A+1=1 A 1 1

Digital Electronics_Jean-Paul NGOUNE

A+A=A A A A

A + /A = 1 A /A 1

/A

3.3.2 Multiplicative identities: A being a Boolean variable, the following statements are always true. 0xA=0 1xA=A AxA=A A x/A = 0
0xA=0
0 0 A 0 A 0

1xA=0
1 1 A A A A

AxA=A
A A A A A A

A x /A = 0
A A /A 0 /A 0

Remark 3.2: Double complementation Complementing a variable twice results in the original Boolean value.

/A

//A = A

Digital Electronics_Jean-Paul NGOUNE

3.4 Boolean algebraic properties: Let us consider three Boolean variables A, B and C. The following properties are true. Commutative property: Addition:

A+B=B+A Multiplication:

AxB=BxA Associative property: Addition:

A + (B + C) = (A + B) + C Multiplication:

A(B.C) = (A.B)C Distributive property:

A(B + C) = A.B + A.C 3.5 Boolean rules for simplification: There are several rules for Boolean algebra intended to be used in reducing complex Boolean expressions to their simplest forms. The simplification of the Boolean expressions of logic circuits brings many advantages: Higher operating speed (less delay time from input signal transition to output signal transition). Less power consumption (few IC used). Less cost. Greater reliability.

3.5.1 Rule n1: A + AB = A A + AB = A (1 + B) = A (1) =A 3.5.2 Rule n2: A + AB = A + B

A + AB = A + AB + AB (Apply the previous rule to expand A term to A + AB)

= A + B A + A (Factorising B)

Digital Electronics_Jean-Paul NGOUNE

= A + B(1) (Applying identity A + A = 1 )

= A+ B

3.5.3 Rule n3: ( A + B ()A + C )= A + BC

( A + B ()A + C )= A. A + A.C + A.B + B.C

(Distributing terms)

= A + AC + AB + BC (Applying identity AA = A) = A + AB + BC (Applying A + AC = A) = A + BC (Applying A + AB = A)

3.6 Circuit simplification example: Let us consider the following logic circuit.
A B Q

1. Write the Boolean expression of the output Q:

Q = AB + BC (B + C )

2. Reduce this expression to its simplest form using the rules of Boolean algebra.

Q = AB + BCB + BCC
= AB + BC + BC (Using the identity A.A =A) = AB + BC (Identity A.A = A)

Q = B( A + C

)
Q

3. Generate the schematic diagram of the simplest expression

B

A C

Remark 3.3 To convert Boolean expression to a gate circuit, you should evaluate the expression using standard order of operation: Multiplication before addition, Operation within parenthesis before anything else.

Digital Electronics_Jean-Paul NGOUNE

Exercise 3.1: Simplify the following expressions using Boolean algebra and generate the schematic diagrams of the simplest expressions.

Y = B +C B+C + A+ B+C

( ( ) ) Z = (C + D + AC D + AB.C + A..BCD + A.C.D )

A B

X = A.B.C + A.BC + ABC + AB.C + A.B.C

3.7 The exclusive-OR function

A B
A B = A.B + A.B

3.8 DeMorgan s theorem

AB = A + B A + B = A..B

DeMorgan s theorem may be thought in terms of breaking a long bar symbol. When a long bar is broken, the operation directly imply the changes from addition to multiplication or vice versa, and the broken bar pieces remains over the individual variables. Remark 3.4: When multiple layers of bar exists in an expression, you may only break one bar at a time. Example 3.1: Let us simplify the following expressions:
A + BC = A.BC (The superior bar broken)

= A.BC
A + B + C = A.B.C

= A.BC

Digital Electronics_Jean-Paul NGOUNE

3.9 Converting truth table into Boolean expression: We can convert truth table into Boolean expression using one of the following methods: Sum of products (SOP) Product of sums (POS)

3.9.1 Sum of products: Boolean expressions may be generated from truth table quite easily using the following steps: Determine which rows of the table have an output of 1; Write one product for each raw; Sum all the product terms.

This creates a Boolean expression representing the truth table as a whole. Example 3.2: Let s consider a logic circuit having the following truth table: A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1 Q 0 0 0 1 0 1 1 1 Row 1 Row 2 Row 3 Row 4 Row 5 Row 6 Row 7 Row 8

The rows 4, 6, 7 and 8 have an output of 1, each raw gives us a product. By summing those products, we obtain the following Boolean expression which is that of the output Q.
Q = ABC + A BC + ABC + ABC

Exercise 3.2: Simplify the expression of the output Q treated in the example above using Boolean algebra and generate the schematic diagram of the simplest expression.

Digital Electronics_Jean-Paul NGOUNE

3.9.2 Product of sums: Boolean expression may be also generated from truth table quite easily by determining which rows of the table have an output of 0, writing one sum term for each row and finally multiplying all the terms. Example 3.3: Let us consider a logic circuit having the following truth table. A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1 Q 0 1 1 1 1 1 1 0 Row 1 Row 2 Row 3 Row 4 Row 5 Row 6 Row 7 Row 8

The rows 1 and 8 have an output of 0; each row gives us a sum. The product of those sums gives us a Boolean expression which is that of the output of the logic circuit. In fact, we have:
Q = A.B.C + ABC

Q=Q
= A..B..C + ABC

( ) = (A..B..C ). A.B.C = A + B + C (A + B + C ) A = ( A + B + C () + B + C )
In reality for each row having an output of 0, we should notice that we have but

Q = ( A + B + C ).( A + B + C )

the inverted output product ( Q ). By inverting that output ( Q ), we obtain a sum using DeMorgan s theorem. Finally, the product of all those sums gives us the output of the logic circuit.

Digital Electronics_Jean-Paul NGOUNE

10

Remark: Generally, the sum of products is more used than the product of sums to convert a truth table into Boolean expression. However, when a few number of rows have an output of 0, it is preferable to use the POS than to use the SOP. Exercise 3.3: Generate the logic diagram of the circuit treated the example 3.3. Exercise 3.4: Assuming that A B = A.B + A.B , proof that A B = A.B + A..B 3.10 Conclusion: This chapter has permitted us to study the identities and the properties of the Boolean algebra. Those are tools used for the simplification of the Boolean expressions. However, this simplification is sometime very difficult to carry out, especially for logic circuit having complex Boolean expression. To solve this problem, another method of simplification has been proposed: that is Karnaugh mapping. It is the topic of the next chapter.

REVIEW QUESTIONS
1. Simplify the following expressions using Boolean algebra:

X = ABCD + A..B.C .D + A.B.C D + A.B.C.D + A.BCD + ABC.D + ABC D + ABC D + ABCD Y = ABC + ABC + ABC + ABC
2. Simplify the following circuit using the Boolean algebra.
A B C

Digital Electronics_Jean-Paul NGOUNE

11

3. Conceive de logic circuit corresponding to the following truth table. A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1 X 1 0 1 1 1 0 0 1

4. Logic gates can be realised using diodes and resistors. Consider the following circuits:
Vcc

Va S Vb

Va S Vb

a. Analyse the functioning of each circuit by filling the following truth table. Va 0 0 1 1 Vb 0 1 0 1 Vs

b. Deduce the logic gate described by those circuits

Digital Electronics_Jean-Paul NGOUNE

12

5. Logic gates can also be realised using resistor and transistor: That is resistor transistor logic (RTL). Consider the following circuits:
Vcc Vcc

Vout Va Vout Va

Vb Vb

Vcc

Vout Vin

Study the functioning of each of those circuits and determine the logic gate described by each of them.

6. Logic gates can also be realised using diodes and transistors.

Vcc

Va Vb

Vout

Study the functioning of the circuit and deduce the logic gate that it describes.

Digital Electronics_Jean-Paul NGOUNE

13

7. A3A2A1A0 is a binary number having four bits. A3 is the MSB and A0 is the LSB. Conceive a logic circuit that produces an output of 1 when the binary number is superior to 0010 and inferior to 1000. 8. A logic circuit has 4 inputs A, B, C and D, and one output X. The output X is high only if C and D are low while A or B or both (A and B) are high. Conceive the logic circuit so described.

NB: The conception of a logic circuit requires the following steps: Truth table; Determination of the simplified expression of the output; Logic diagram of the circuit using logic gates.

References: 1. Digital systems, principles and applications, Ronald J.Tocci, 3rd edition, Prentice-Hall inc., Englewood Cliffs, New Jersey , USA,1985. 2. Lessons In Electric Circuits Volume IV Digital, Tony R. Kuphaldt, Fourth Edition, 2007, www.allaboutcircuits.com . www.ibiblio.org/obp/electricCircuits.

Digital Electronics_Jean-Paul NGOUNE

14