!

Ms Sandhya Rani Dash UNIT 3: INTRODUCTION TO BOOLEAN ALGEBRA Structure 3.1 Introduction 3.2 Objectives 3.3 Logic Levels 3.4 Logic Gates and their Operations 3.4.1 AND operations 3.4.2 OR operations 3.4.3 NOT operations 3.4.5 NAND operations 3.4.6 NOR operation 3.4.7 EX-OR operation 3.4.8 EX-NOR operation 3.4.9 EX-OR operations 3.5 Universal Gates 3.6 Basic Rule, Properties Identities of Boolean Algebra 3.6.1 Complementation law 3.6.2 AND law 3.6.3 OR law 3.6.4 Properties of Boolean algebra 3.7 De MorgansTheorem and its Applications 3.8 Logic Minimization using Boolean algebra 3.9 Formulation and Design of simple Logic Circuits 3.10 Sum of Products and Product of Sums 3.10.1 Minterm & Maxterm 3.10.2 Canonical SOP expression 3.10.3 Canonical POS expression 3.11 Unit Summary 3.1 Introduction A new kind of algebra called Boolean algebra or switching algebra is developed by Boole in 1854. He stated that symbols can be used to represent the structure of logical thoughts . Boolean algebra is a system of mathematical logic, which is governed by certain rules. The variables used in Boolean algebra can have values either 0 or 1. since, we know the digital signals are discrete in nature and can only assume one of the two values 1 (for TRUE/ON/HIGH) and 0 (for FALSE/OFF/LOW) Boolean algebra differs from both the ordinary algebra and the binary number system. For Example: In Boolean algebra, A + A = A andA A=A, since the variable A has only one logical value. In case of ordinary algebra A+A= 2A and A A= A2 , since

here the variable A has a numerical value. In case of binary number system 1 + 1 = 10 where as in case of Boolean algebra 1 +1 = 1 and in ordinary algebra 1 + 1 =2 Boolean algebra can be used to simplify the design of logic circuits and minimization of logic functions. These minimization techniques reduce the requirement of hardware. Logical functions are expressed in terms of logical variables. These logical variables are represented in the binary form. Any arbitrary logic function can be expressed in a standard or canonical sum of product form or product of sum form. These two forms are used for designing the logic circuits which is explained in this unit.

3.2 Objectives After going through this unit you will be able to: i) draw the symbol and write the truth tables for each of the basic logic gates. ii) write the Boolean expressions for each of the basic logic gates iii) use a NAND and NOR gate as an universal gate. iv) develop the Boolean expressions for the output of a combinational logic circuit. v) design and construct a logic circuit to implement a given Boolean expression. vi) express a logical function in terms of sum of product and product of sum forms. vii) explain minterm & maxterm.

3.3 Logic Levels In digital system, a digital signal has two discrete levels and is represented by two voltage levels. i.e HIGH & LOW Logics 1 & 0 are represented by voltage levels HIGH & LOW respectively. Signals represented in digital systems are of two types 1. Positive logic system 2. Negative logic system In case of positive logic system, the presence of a signal is represented by the higher

value i.e. logic 1 represents the HIGH voltage & 0 represents the LOW voltage In case of negative logic system, the absence of a signal is represented by the higher value i.e. logic 0 represents the HIGH voltage & 1 represents the LOW voltage For Example If the voltage levels are -0.1 volt to -5.0 volt, then in a positive logic system, logic 0 represents -5 volt and logic 1 represents -0.1 volt In a negative logic system, logic 0 represents -0.1 volt and logic 1 represents -5.0 volt Similarly, If the voltage levels are 0.1 volt to 5.0 volt, then in a positive logic system, logic 1 represents 5 volt and logic 0 represents 0.1 volt In a negative logic system, logic 1 represents 0.1 volt and logic 0 represents 5.0 volt Both positive and negative logics are used in digital system but the positive logic is more common. 3.4 Logic Gates and their Operations Logic gates care the fundamental building blocks of a digital system. Such that a device has the ability to make decisions. That means it produces output level when some combinations of input levels are present. Logic gates are electronic circuits which are made up of number of electronic devices and components. There are three basic types of gates- AND, OR, and NOT. In addition there are also some other gates such as NAND, NOR, X-OR, X-NOR. These gates are used as standard gates in digital system to describe various logical operations such as AND, OR, NOT, NAND, NOR, X-OR, X-NOR operations. The interconnection of gates to perform a variety of logical operation is called logic design. The different logic operations such as AND, OR, NOT, NAND, NOR, X-OR, X-NOR performed in Boolean algebra.

3.4.1 AND operations In Boolean algebra the AND operation is similar to multiplication in ordinary algebra. The AND gate which performs the logical multiplications is as follows: A B It has two input terminals A, B where, the digital signals are applied and the output is obtained at the out put terminal Y. Mathematically the AND operation can be written as Y= A.B=AB The truth table of AND operation is as follows: A 0 0 1 1 B 0 1 0 1 AB 0 0 0 1 Y

So the AND operation can be defined as the output Y is TRUE if and only if both the inputs are TRUE otherwise it is false. It can be verified from the above truth table that: The AND operation is Commutative i.e. AB=BA and also Associative i.e. (AB) C = A (BC) 3.4.2 OR operations The OR operation in Boolean algebra is similar to addition in ordinary algebra. The OR gate which perform the digital addition is as follows:

It is defined as the output of an OR gate if FALSE if and only if, both the inputs are FALSE other wise it is true.

The functional relationship between the inputs and the output can be written as: Y = A OR B = A + B The truth table of the OR gate is as follows: A 0 0 1 1 B 0 1 0 1 A+B 0 1 1 1

The common symbol used for this logical addition is (+) 3.4.3 NOT operations The NOT operation in Boolean algebra is also defined as complementation or inversion i.e. negation as performed by the NOT gate. This operation converts the logical 1 to logical 0 and vice versa. The symbol used for this operation is a bar or prime over the function or the variable. i.e. __ A or A' The truth table of NOT gate is as follows: A 0 1 Its logical equation can be written as _ Y = NOT A = A = A' Y 1 0

The presence of a small circle, known as bubble, always denote inversion of digital circuits 3.4.4 NAND operations The NAND operation in Boolean algebra is equivalent to AND operation and NOT operations. The complement of AND function is called NAND function. The graphical symbol of NAND gate comprised of a AND gate followed by a small circle as follows:

The output of the NAND gate can be represented as: ___ Y= AB The truth table of the NAND gate is: A 0 0 1 1 B 0 1 0 1 Y 1 1 1 0

The output of NAND gate is FALSE if both A and B are TRUE, otherwise it is TRUE 3.4.5 NOR operation The NOT OR operation is known as NOR operation or it is the complement of OR function. Mathematically it can be described as: _____ Y=A+B The standard symbol of the NOR gate is as follow:

It comprised of an OR gate followed by a small circle. The Truth Table is as follows: A 0 0 1 1 B 0 1 0 1 Y 1 0 0 0

The NOR operation can be defined as the output of the NOR gate is TRUE if and only if both A and B are FALSE otherwise it is FALSE. NOR operation is commutative, i.e. _____ ____ A+B=B+A

NOR operation is not associative i.e. ___________ _________ _____ _____ A + B + CA+B+C 3.4.6 EX-OR operations The graphical symbol of the EX-OR gate is similar to that of the OR gate except of the additional curve line on the input side. The symbol used for the EX-OR operation is as follows:

The Ex-OR operation is also called as module 2 addition, since it assigns to each pair of elements its module 2 sum. This operation is widely used in Digital Circuit and System. Its logical equation can be expressed as: Y = A (+) B = A EX-OR B The truth table is as follows: A 0 0 1 1 B 0 1 0 1 Y 0 1 1 0

The output of the EX-OR gate is true when both the inputs are not same. i.e. one of them is 0 and other one is 1. Where as the output become FALSA when both the inputs are same (0 or 1).

3.4.7 EX-NOR operations The complement of EX-OR gate is known as exclusive NOR gate. It is indicated by the small circle on the output side of the graphical symbol.

Mathematically it can be represented as: Y=A The truth table of EX-NOR gate is given below A 0 0 1 1 B 0 1 0 1 Y 1 0 0 1 B = A EX-NOR B

The output of the Ex-NOR gate is TRUE when both the inputs are same i.e. 0 or 1.Where as the output becomes FALSE when both the inputs are not same. Self Check Exercise 1 A. For Q No. 1 - 5 selecting the most appropriate alternative from among the four alternatives given below each question 1. A logic gate is an electronic circuit which a) makes logic decisions c) works on binary algebra b) allows electrons flow in one direction d) alternates between 0 and 1 values .

2. In positive logic, logic state 1 corresponds to a) positive voltage c) zero voltage b) higher voltage level d) lower voltage level

3. In negative logic, logic state 1 corresponds to a) negative voltage c) more negative voltage b) zero voltage d) lower voltage level

4. The output of a two input OR gate is zero only when its a) both inputs are 0 c) both inputs are 1 b) either input is 1 d) either input is 1

5. A NOR gate produces an output only when its two inputs are a) high 6. An AND gate a) implements logic addition c) is an any- or-all gate b) is equivalent to a series switching circuit d) is equivalent to parallel switching circuit b) low c) different d) same

7. When an input electrical signal A= 10100 is applied to a NOT gate, its out put signal is a) 01011 b) 10101 c) 10100 d) 00101

8. For getting an output from an EX-NOR gate, its both input must be a) high b) low c) at the same high level d) at the opposite logic levels

9. A NOR gate is ON only when all its inputs are a) ON b) positive c) high d) OFF

10. In a certain 2-input logic gate, when A=0, B=0, then C=1 and when A=0, B= 1, then again C= 1. It must be a) XOR gate b) AND gate c) NAND gate d) NOR gate

B. Answer the following questions 11. Differentiate between positive logic and negative logic system. 12. Verify that the operations of AND gate and OR gate are commutative and Associative 3.5 Universal Gates A gate that can perform all the basic logical operations is known as universal gate. NAND and NOR gates are called Universal gates or universal building blocks because both the gates are sufficient for the realization of any logical expression. But NAND and NOR gates can perform all the three basic logical functions (AND, OR, and NOT).

The following figure shows how AND, OR, and NOT gates are used to realize various logic gates.

The three basic logic operations AND, OR, and NOT can be performed by using the NOR gate as follows:

3.6 Basic Rule, Properties Identities of Boolean Algebra Boolean algebra is governed by certain rules and laws. These rules can be used for the minimization of logical operations. It is the convenient and systematic method of expressing and analyzing the operation of digital circuits. The Axioms or postulates of Boolean Algebra are a set of logical expressions that we accept without proof and upon which we can build a set of useful theorems. Boolean Multiplication (Axiom 1-4) Axiom 1: 0 0 = 0 Axiom 2: 0 1 = 0 Axiom 3: 1 0 = 0 Axiom 4: 1 1 = 1 _ Axiom 9: 1 = 0 3.6.1 Complementation law The term complement means to invert. i.e. 0 is converted to 1 and vice versa. The laws are; _ 1. 0 = 1 _ 2. 1 = 0 _ 3. if A = 0; A = 1 _ 4. if A = 1; A = 0 = 5. A = A 3.6.2 AND laws A.0 = 0 A.1 = A A.A = A _ A. A = 1 Boolean Addition (Axiom 5-8) Axiom 5: 0 + 0 = 0 Axiom 6: 0 + 1 = 1 Axiom 7: 1 + 0 = 1 Axiom 8: 1 + 1 = 1 _ Axiom 10: 0 = 1

3.6.3 OR laws A+0=A A+1=A A+A=A _ A+A=1 3.6.4 Properties of Boolean algebra The properties of Boolean algebra are Commutative, Associative, Distributive, Absorption, Consensus, Identity, Ideompotence. Commutative property Boolean algebra is commutative over addition and multiplication. i.e. A+B=B+A AB = BA According to this property, the change in position of AND or OR variables makes no difference. Associative property Boolean algebra holds the associative property over addition and multiplication. i.e. A + (B + C) = (A + B) + C and and

A (BC) = (AB) C According to this law, it makes no difference in what order the variables are grouped during the AND and OR operation. Distributive property The Boolean addition is distributive over Boolean Multiplication. Such as: 1. A (B+ C) = AB + AC 2. A + BC = (A + B) (A + C) _ 3. A + AB = A + B Absorption Laws 1. A + AB = A 2. A ( A + B) = A

Consensus Laws

_ _ 1. AB + AC + BC = AB + AC _ _ 2. (A + B) (A + C) (B + C) = (A + B) (A + C)

Idempotence Laws Idempotence means the same value. The laws are: 1. A. A = A 2. A + A = A The other basic laws (theorems) of Boolean algebra are summarized as follows: S. No 1 2 Law Idempotency Law Complementation or Negation Law Double Inversion Law Identity Law Null Law = A=A A.1 = A & A + 1 = 1 A.0 = 0 & A + 0 = A Operation A.A=A& A+A=A _ A. A = 0 & _ A+A=1

3 4 5

3.7 De Morgans Theorem and its Applications DeMorgansdevelopedthefollowingtwoimportanttheoremsinBooleanalgebra Theorem 1 Itstatesthatthecomplementofasumofvariablesisequaltotheproductoftheir individualcomplement ___ _ _ A+B = A. B Theorem 2 It states that The complement of the product of variables is equal to the sum of their individual complements. i.e. ___ _ _ AB = A + B

DeMorganstheoremcanbeprovedforanynumberofvariables.Theproveby induction method is as follows: Truth Table 1 A 0 0 1 1 2 B 0 1 0 1 3 _ A 1 1 0 0 4 _ B 1 0 1 0 5 A+ B 0 1 1 1 6 A. B 0 0 0 1 7 ____ A+B 1 0 0 0 8 __ A.B 1 0 0 0 9 ___ A.B 1 1 1 0 10 _ _ A+ B 1 1 1 0

From the above table it is clear that the columns 7 & 8 are equal. _____ _ _ Therefore, A + B = A . B Similarly, Columns 9 & 10 are equal. ___ _ _ Therefore, A. B = A + B Self Check Exercise 2 A. For Q No. 13-17 Select the most appropriate alternative from among the four alternatives given below each question 13. Which of the following is the universal gate a) NOT b) AND c) NAND d) EX-OR .

14. How many NAND gates are need for the logic function X.Y a) 1 b) 2 c) 3 d) 4

15. Which of the following represent commutative law, associative law and distributive law 1) A. (B. C) = (A. B) . C 2) A. (B + C) = A. B + A . C 3) A + B = B + A a) 1, 3 & 2 respectively c) 3, 2 & 1 respectively b) 2, 1 & 3 respectively d) 3, 1 & 2 respectively _ d) A. A = 0

16. Which of the following expression is not correct? _ a) A + 0 = A b) A . 1 = 1 c) A + A = 1

17. Which of the following statement is true _ _ a) A + AB = A b) A (A + B) = AB _ _ c) AB + AB = A d) CA + CAB = CA + CB B. Answer the following questions 18. State and prove commutative, associative and distributive property of Boolean Algebra 19. State and explain De Morgans theorem which transform a sum into a product form and vice versa. Draw the logic equivalent circuits representing the theorem using basic gates. . 3.8 Logic Minimization using Boolean Algebra Boolean expression can be reduced to a simple form by applying the property, laws and theorems of Boolean algebra. The reason behind the simplification of a Boolean expression is that, each logical operation on the expression represents a correspond element of a hardware. Therefore realization of a logical circuit with the minimal expression involves in reduction of cost and complexity of the system. This also increases the reliability of that system. Steps involved for the minimization of Boolean expression are as follows: Step I Remove parentheses by multiplying all variables. Step II If a number of identical terms are there in a expression, then drop all the terms retaining only one of them. For Example AB + AB + AB + AB = AB Step III Look for a variable and its negation on the same term. This term can be dropped For Example __ _ A.B B =A.0 =0 or ABCC = AB.0 =0

Step IV If a pair of terms is identical except for one variable; then the larger term can be dropped out. For Example __ _ _ _ _ _ ABCD + ABC = ABC ( D+1) = ABC .1=ABC Step V If a pair of terms have same variable except a variable in one terms complemented whileinthesecondtermitisnt , then such terms can be combined into a single term by dropping with that variable. For Example __ _ _ _ _ _ ABCD + ABCD = ABC (D+D) = ABC.1 =ABC Now let us simplify some Boolean expressions. EXAMPLE 1 _ Reduce the expression A+B [AC+ (B+C) D] The given expression is _ Multiply D with B+C _ Multiply B with (AC+BD+ CD) Write in order Factor Reduce Simplify EXAMPLE 2 Reduce the expression (A+AB) (B+BC) (C+ AB) The given expression is Factor Reduce (A+AB) (B+BC) (C+ AB) =A (1+B) B (1+BC) (C+AB) = AB(C+AB) _ A+B [AC+ (B+C) D] _ =A+B (AC+BD+ CD) _ = A + BAC + BBD + BCD _ = A + ABC + BD + BDC _ = A (1 + BC) +BD (1+C) = A .1 + BD .1 = A + BD (Answer)

Expand AB(C+AB) Reduce Factor Simplify

=ABC + AB.AB = ABC+ AB =AB (1 + C) = ABC (Answer)

3.9 Formulation and Design of Simple Logic Circuits Combinational circuits can be designed from Boolean expressions by using logic gates. Conversely, combinational circuits can be translated into Boolean expressions. The method of conversion from a logic circuit to a Boolean expression and vice versa is given below. To convert a logic circuit into Boolean expression, the steps are: i) First label all the input signals ii) Write down the output of each logic gate connecting to these input signals in terms of Boolean expressions iii) Continue this process until the output is reached. It can be better understood from the following example. Example 1 Write the Boolean expression for the logic diagram given below.

Solution In the above diagram, there are three input signals A, B &C which is fed to three AND gates. The output of the three AND gates can be labeled as AB, BC & AB.

These three outputs AB, BC &AB are fed to the OR gates with the inputs A, B, C respectively. So the output of the three OR gate can be labeled as A + AB, B + BC, C + AB. Then the output of these three gates are given to the input of an AND gate. So the output of that AND gate can be written as( A + AB) (B + BC) (C + AB), which is the output of the given combinational circuit. This can be clearly understood from the following figure.

Conversion from the Boolean expression to logic circuits To convert a Boolean expression to logic circuit, first start with the output and work towards input. Step I : Draw the logic diagram corresponding to the given Boolean expression . Step II: Draw the logic diagram of each element of the given expression . Step III: Determine the no. of input signals in the expression. Step IV: Draw the complete logic circuit of the given Boolean expression. For Example Design the logic diagram for the Boolean expression given below. _ _ X=BC + BC Solution: The given Boolean expression is the out[put of an OR gate. So according to the steps explained above, draw the OR gate with two inputs as shown below.

_ _ According to step ii, draw the logic diagram of each element (BC, BC) of the given expression.

According to step iii, B & C must be the output of an inverter, whose inputs are B & C respectively. i.e.

Draw the complete logic circuit of the given Boolean expression by using the logic diagrams explained above.

3.10 Sum of Product and Product of Sums Any Boolean expression can be expressed in two different forms. Such as: i) Sum of products (SOP) ii) Product of sums (POS) These two forms are conveniently used as the standard methods for designing the circuits. Sum of products (SOP) The logical sum of two or more logical product terms, is called a !"#$ %&$ '(%)"*+! expression. The AND function (.) is referred to as a '(%)"*+ and the OR function (+ sign) is referred to as a !"#. The variables in a sum & product term can either appear

in complemented or uncomplemented form. The sum of product expression is basically an OR operation of AND operated variables. For Example _ i) Y = AB + BC + AC ___ _ ii) Y = ABC + ABC + ABC Product of sums (POS) The logical product of two or more logical sum terms is called a '(%)"*+$ %&$ !"# expressions. It is basically an AND operation of OR operated variables. For example: _ i) Y = (A+B) (B+C) ( C+A) _ ii) Y = (AB+BC) (AC+BC) 3.10.1 Minterm and Maxterm Each of the product terms in the standard SOP form is called a #,-+.(# and a sum term in the standard POS form is called a$#/0+.(#. Each minterm can be obtained by the AND operation of all the variables of the function and similarly each maxterm can be obtained by OR operation of all the variables of the function. The minterm & maxterm are usually expressed as binary words in terms of0s&1s. Each minterm & maxterm is represented by mi
&

Mi respectively. Where, the

subscript i is the decimal equivalent of the natural binary no. corresponding to the minterm &maxterm. The minterm of a 3-variable function can be represented as m0, m1, m2, m3, m4, m5, m6, m7. similarly the maxterm of a 3-variable function can be represented as M0, M1, M2, M3, M4, M5, M6, M7, Where the no. of minterm & maxterm is equal to 2n . For minterms, the binary numbers are formed by representing each non complemented variable by 1 and the complemented variable by 0. For maxterms, the noncomplementedvariablestakenas0s&thecomplementedvariablestakenas1s

For a 3-variable logical function, the eight minterms & maxterms with their symbolic designation are listed in the following 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 Minterm ___ ABC __ ABC _ _ ABC _ ABC __ ABC _ ABC _ ABC ABC Maxterm A+B+C _ A+B+C _ A+B+C _ _ A+B+C _ A+B+C _ _ A+B+C _ _ A+B+C _ _ _ A+B+C

3.10.2 Canonical SOP expression Boolean functions expressed as a sum of minterms or maxterms, are said to be in canonical form. Canonical SOP expression is defined as the logical sum of all the minterms derived from the rows of a truth table, for which the value of the function is 1. It is also called a minterm canonical form. For example, if the canonical SOP form of a 3-variable logic function Y has three minterms, _ _ _ _ _ ABC, ABC, ABC, then this can be expressed as , Y= m (0, 5, 6) = m0 + m5 + m6 ___ _ _ = ABC + ABC + ABC Where 0, 5, 6 represents the corresponding decimal codes of the minterms. The following procedure can be used to obtain the Boolean function in its sum of minterm form or canonical sop form.

i) Examine each minterm in the given Boolean expression .Retain it if it is a minterm. If the Boolean expression isnt in SOP form, it can be made so by expanding the expression into a sum of AND terms ii)checkforvariablesthataremissingineachproductwhichisntaminterm. _ For each missing variable, multiply the product by X+ X iii) Multiply all the products and drop out the redundant terms. iv) Replace the non-complementedvariablesby1sandthecomplementedvar iables by0sanduseallthecombinationsintermsof1s&0stogenerateminterms. For Example Obtain the canonical SOP form of the function. _ Y = A + BC Solution: THE given Boolean expression contains 3 variables A, B & C _ The first term A is missing two variables, B & C. So it is multiplied by (B+B) _ _ & C+C). THE second term BC, is missing one variable, A. So it is multiplied by _ (A + A). Now the given Boolean expression can be written as, _ _ _ _ Y = A (B+B) (C+C) +( A+A) BC _ _ _ __ = (AB +AB) (C + C) + ABC + ABC _ _ __ _ __ = ABC+ ABC +ABC + ABC + ABC + ABC Rearranging the minterms in ascending order we finally obtain, __ __ _ _ Y = ABC + ABC + ABC + ABC + ABC = 001 + 100 + 101 + 110 + 111 = m1 + m4 + m5 + m6 + m7

Y (A, B, C) = m (1, 4, 5, 6, 7)

3.10.3 Canonical POS expression Canonical POS expression is defined as the logical product of all the maxterms derived from the rows of a truth table, for which the value of the function is 0. It is also called a max term canonical form. For example, if the canonical POS form of a 3variable logic function Y has four maxterms, _ _ _ _ _ (A+B +C), (A+B +C), (A+B+C), (A+B+C), can be expressed as: Y = ( 0, 4, 2, 7) = M0. M2. M4. M7 _ _ _ _ _ = (A+B +C) (A+B +C) (A+B+C) (A+B+C) Where 0,4,2,7 represents the corresponding decimal codes of the maxterms. The following procedure can be used to obtain the Boolean function in its canonical POS form. i) Examine each maxterm in the given Boolean expression .Retain it if it is a maxterm. If the Boolean expression isnt in POS form, it can be made so by expanding the expression into a product of OR terms ii) check for variables that are missing in each sum whichisnt a maxterm. _ For each missing variable, add XX to the sum term iii) Expand the expression using the distributive property and eliminate the redundant terms. iv) Replace the non-complemented variables by 0 sand the complemented variables by 1sanduseallthecombinationsintermsof 1s&0stogeneratemaxterms. For Example Obtain the canonical POS form of the function. _ _ Y (ABC) = (A+B) (B+C) (A+C) Solution In the given expression, the variable C is missing in the first term, A in the second term, and B in the third term. _ _ _ Therefore, C.C has to be added in the first term, A.A in the second and B.B in the third term as follows:

_ _ Y (ABC) = (A + B) (B+ C) (A + C) _ _ = (A + B + 0) (B + C + 0) (A + C + 0) _ _ _ _ = (A + B + CC) (B + C + AA) (A + C + BB) With the use of distributive property each term can be expanded as: _ _ _ _ _ _ _ Y = (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+ B + C) (A+ B + C) (A+ B + C) _ _ _ _ _ _ [As (A+ B + C) (A+ B + C) = (A+ B + C ] = (010 ) ( 011) ( 000 ) =M(2, 3, 0, 4, 1) This is called the maxterm canonical form or the canonical product of sum expression Self Check Exercise 3 A. For Q No. 20-24 Select the most appropriate alternative from among the four alternatives given below each question 20. the simplified form of the Boolean expression (X + Y + XY) (X + Z) is a) X + Y + Z b) XY + YZ c) X + YZ d) XZ + Y . ( 100 ) ( 001 )

21. The term sum-of-products in Boolean algebra means a) The AND function of several OR functions b) The OR function of several AND functions c) The OR function of several OR functions d) The AND function of several AND functions 22. The term product-of-sum in Boolean algebra means a) The AND function of several OR functions b) The OR function of several AND functions c) The OR function of several OR functions d) The AND function of several AND functions

23. What is the form of Boolean expression AB + BC = Y ? b) Sum of products d) Matrix _ _ 24. What is the form of Boolean expression (A + B) (C + D) = X ? a) Product-of-sums c) Karnaugh map b) Sum of products d) Matrix a) Product-of-sums c) Karnaugh map

B. Answer the following questions _ __ ___ 25. Reduce the following Boolean expression Y = A + AB + ABC + ABCD _ 26. Obtained the canonical product of sum form of the function Y = A + BC 3.10 Unit Summary In this unit a brief exposure to Boolean algebra is given. The basic building blocks used to construct combinational circuits are logic gates. Various logic gates and the operation of these gates are described in this unit. The relationship between the input and output signals can be described mathematically using Boolean algebra. The Laws and theorems of Boolean algebra are also introduced in this unit. At the same time this unit deals with conversion of Boolean expressions to logic circuits and vice versa. The techniques for the simplification of logic equations using Boolean algebra are also presented in this unit. Answers to Check Your Progress 1. (a) 2. (b) 3. (d) 4. (a) 5.(c) 6. (b) 7.(a) 8.(c) 9.(d) 10.(c)

11. Refer to section 3.3 12. The commutative and associative property of AND gate & OR gate can be verified from its Truth Table. [Hints: First find out A.B, taking two inputs A & B then find B.A for verification of the commutative property of AND gate. Then find A (B.C) taking three inputs A, B, & C and then find (A.B) C for verification of associative property of AND gate. Similarly verify for OR gate also] 13. (C ) 14. (b) 15. (d) 16. (b) 17. (c)

18. It can be easily proved by using Truth Table. Please refer to section 3.6.4 19. Please refer to section 3.7 20. (c) 21. (b) 22. (a) 23. (b) 24. (a) _ __ ___ ___ ___ 25. A + AB + ABC + ABCD = A + B + ABC + ABCD [As A + AB = A + B] _ ____ = A + B + BC + ABCD ____ = A + B + C + ABCD _ = A + B + C + CD =A+B+C+D _ 26. Y = A + BC _ = (A + B) (A + C) [As A + BC = (A + B) (A + C)] _ _ _ = (A + B + CC) (A + C + BB) _ _ _ _ _ = (A + B + C) (A + B + C) (A + B + C) (A + B + C) [As (A + B) (A + B) = A] _ _ _ = (A + B + C) (A + B + C) (A + B + C) = M2M3 M0 = M0M2M3 Therefore Y = (0, 2, 3) References Bignell, J and Donovan, R. (1989) Digital Electronics, Delmar Publishers Inc. New York Jain, R. P. (2007) Modern Digital Electronics; Third Edition; Tata McGraw-Hill Publishing Company Limited; New Delhi Kumar, A. A. (2004) Fundamentals of Digital Circuits; Seventh Edition; Eastern Economy Editions; Prentice- Hall India Pvt. Ltd; New Delhi Mano, M. M. (2006) digital Logic and Computer Design; Second Edition; Eastern Economy Editions; Prentice- Hall India Pvt. Ltd; New Delhi Malbert, A. B. and Leach, D. P. (1993) Digital Principles and Applications, Tata Mc Graw hill Publishing Company Limited, New Delhi Salivahanan, S. and Arivazhagan, S. (2006) Digital Circuits and Design, Vikas Publishing House Pvt Ltd, Delhi

Srinivasan, P. (2007) National Programme Technology Enhanced Learning Video Lectures on Introduction to Digital Circuits and System. Lecture I & II

Unit End Exercise Answer the following questions 1. What is the only input combination that will produce a HIGH at the output of a six input and gate 2. Explain how the basic gates can be realized using NAND gates. 3. Draw the logic diagram of the following expressions ___ a) X = A + B + CD b) (A + B) (B + C) (A + C) 4. Simplify the following expressions __ ___ _ _ __ a) ABC + ABC + ABC + ABC _ _ _ _ b) (A + B + C) (A + B + C) (A + B + C) (A + B + C) 5. Indicate whether Y is a 0 or a 1 in the equation Y = ABC + AB, under the following conditions: a) A = 1, B= 0, C = 1 b) A = 0, B = 0, C = 0