BITS Pilani presentation

BITS Pilani
Pilani Campus

Rekha.A Faculty

Logic gates and Boolean Algebra.

Boolean Algebra like any other deductive mathematical system, may be defined with a set of elements, set of operators and a number of Postulates. Boolean algebra differs in a major way from the ordinary algebra in that Boolean constants and variables are allowed to have only 2 possible values 0 or 1. Thus the Boolean 0 or 1 do not represent the actual numbers but instead represent the state of a voltage variable or what is called as logic levels.

In Boolean algebra there are 3 basic operations: OR, AND, NOT. These basic operations are called as Logic operations. Digital circuits called Logic Gates can be constructed in such a way that the circuit o/p is the result of a basic logic operations performed on the inputs.

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

Logic gates and Boolean Algebra.

The most common laws used to formulate various algebraic structures are as follows: Associative Law: (x*y)*z = x*(y*z) for all x,y,z S Commutative Law: A binary operator * on a set S is said to be commutative , whenever x*y = y*x for all x.y S

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

Logic gates and Boolean Algebra.

Identity Element: A set S is said to have an identity element with respect to a binary operation * on S if there is an element e S with the property that e * x = x * e = x, for every x S. Distributive Law : If + and . Are the two binary operators on a set S, . is said to be distributive over . Whenever x.(y+z) = (x.y) + (x.z)

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

Postulates and theorems of Boolean algebra x+0=x x.1=x x.x=x x.x=0 x+0=x x+1=1 x+x=x x+x=1 (x+y)= xy and (xy)=x+y De morgans Theorem

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

Verification of Demorgans theorem 1. X 0 0 1 1 Y 0 1 0 1 X+Y 0 1 1 1 (X+Y) 1 0 0 0 X 1 1 0 0 Y 1 0 1 0 XY 1 0 0 0

2. X 0 0 1 1

Y 0 1 0 1

XY 0 0 0 1

(XY) 1 1 1 0

X 1 1 0 0

Y 1 0 1 0

X+Y 1 1 1 0
BITS Pilani, Pilani Campus

ESZC261:Digital Electronics and Microprocessor

Logic Gates :
Building Blocks of Digital Systems.

Basic gates AND, OR, NOT

Universal Gates NAND, NOR

Derived Gates X-OR, X-NOR

ESZC261 Digital Electronics and Microprocessors

BITS Pilani, Pilani Campus

Logic gates and Boolean Algebra.

OR Operation:
Let A and B represent two independent logic variables. When A and B are combined using OR operation , The result x can be expressed as X = A +B

IC 7432
8

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

Logic gates and Boolean Algebra.

Truth table of OR Gate.

Input
A 0 0 1 1 B 0 1 0 1

Out put
C 0 1 1 1

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

Use of OR gate in alarm system:

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

10

Logic gates and Boolean Algebra.

AND operation: If the two logic variables A and B are combined using AND operation , the result X can be expressed as X = A.B AND Gate: An AND gate is a logic circuit with two or more than two inputs and one output. The output of an AND gate is logic1 only when all of its inputs are logic1.In all other cases the output is logic 0.

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

11

. Logic

gates and Boolean Algebra

IC 7408

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

12

Logic gates and Boolean Algebra.

Truth table of AND Gate.

Input
A 0 0 1 1 B 0 1 0 1

Out put
C 0 0 0 1

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

13

Logic gates and Boolean Algebra. Truth Table of 3 Input AND gate

Input
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

Out put
Y 0 0 0 0 0 0 0 1

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

14

NOT Operation: If a Variable A is subjected to the NOT operation the result X can be expressed as X = A

Input A 0 1

Out put B 1 0

IC 7404
ESZC261:Digital Electronics and Microprocessor
BITS Pilani, Pilani Campus

15

NAND GATE: An AND gate followed by a NOT circuit make it as a NAND gate. NAND gate is a logic circuit with two or more than two inputs and one output. The output of NAND gate is logic0 only when all of its inputs are logic1.In all other cases the output is logic 1

IC 7400
ESZC261:Digital Electronics and Microprocessor
BITS Pilani, Pilani Campus

16

Truth table of NAND Gate.

Input
A 0 0 1 1 B 0 1 0 1

Out put
C 1 1 1 0

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

17

NOR Operation: An OR gate followed by a NOT circuit make it as a NOR gate. An NOR gate is a logic circuit with two or more than two inputs and one output. The output of NOR gate is logic 1 only when all of its inputs are logic1.In all other cases the output is logic0.

IC 7402

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

18

Truth table of NOR Gate.

Input
A 0 0 1 1 B 0 1 0 1

Out put
C 1 0 0 0

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

19

XOR GATE:
Exclusive OR gate has high output only when an odd number of inputs are high.

IC 7486

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

20

Truth table of EX-OR Gate.

Input
A 0 0 1 1 B 0 1 0 1

Out put
C 0 1 1 0

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

21

Describing logic circuits Algebraically

Any logic circuit can be described using the Boolean operations. For example consider the following circuit

This Circuit has 3 inputs A,B,C and a single output Y. The Expression for Y = A.B + C

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

22

Example 2 For the circuit shown write the algebraic expression

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

23

Boolean Functions
A Boolean function is described by an algebraic expression consisting of binary variables, the constants 0 & 1 and the logic operation symbols For the function F1 = x+ yz . Write the function table . write the Gate Implementation X Y Z Y X+YZ 0 0 0 1 0 0 0 1 1 1 0 1 0 0 0 0 1 1 0 0 1 0 0 1 1 1 0 1 1 1 1 1 0 0 1 1 1 1 0 1
ESZC261:Digital Electronics and Microprocessor
BITS Pilani, Pilani Campus

24

Gate Implementation of the function F= X+YZ

ESZC261:Digital Electronics and Microprocessor

BITS Pilani, Pilani Campus

25

Find the complement of the function F = xyz+xyz Solution: F = (xyz+xyz) = (xyz)(xyz) = (x+y+z) ( x+y+z) Find the complement of the function F=x(yz+yz) F= {x(yz+yz)} = x+(yz+yz) = x+ (yz)(yz) = x+(y+z)(y+z)
ESZC261:Digital Electronics and Microprocessor 26

BITS Pilani, Pilani Campus

MINTERMS(Sum of Products)
A binary variable may appear either in its normal form(x) or in complement form(x) The two binary variables x and y combined with an AND operation. The four Possible combinations are xy, xy, xy, xy. xy, xy, xy, xy are called Minterms. n variables can be combined to form 2n minterms x 0 0 1 1 Y 0 1 0 1 term XY XY XY XY

m0 m1 m2 m3

f= xy+xy = mo+m2
ESZC261:Digital Electronics and Microprocessor
BITS Pilani, Pilani Campus

27

MAXTERMS(Product of Sum) The two binary variables x and y combined with an OR operation. The four Possible combinations are x+y, x+y, x+y, x=y. x+y, x+y, x+y, x+y are called Maxterms. n variables can be combined to form 2n maxterms x 0 0 1 1 Y 0 1 0 1 term X+Y X+Y X+Y X+Y

M0 M1 M2 M3

f = (x+y)(x+y)(y+x) = M3 . M1. M0
ESZC261:Digital Electronics and Microprocessor 28

BITS Pilani, Pilani Campus

Convert the following equation into standard SOP form y = AB+AC+BC Solution: y= AB(C+C) + AC(B+B) + BC(A+A) = ABC+ABC+ABC+ABC+ABC+ABC = ABC+ABC+ABC+ABC

BITS Pilani, Pilani Campus

Convert the equation into standard POS form Y=(A+B)(A+C)(B+C) Solution: Y=(A+B+CC)(A+BB+C)(AA+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)(A+B+C)

BITS Pilani, Pilani Campus