Scribd
Upload
114 views

Application of BooleApplication of Boolean Algebra - Pptan Algebra

This document discusses Boolean algebra and its application to simplifying logic circuits and expressions. It introduces Boolean algebra and its use in logic circuit design. It then provides 32 Boolean theorems and properties. Examples are given to demonstrate simplifying logic expressions using Boolean algebraic techniques like absorption, distribution, and DeMorgan's laws. The goal of simplification is to arrive at more efficient circuit implementations using fewer literals, terms, and logic gates. Tutorial problems are also provided to prove theorems and further simplify expressions.

Uploaded by

Riheen Ahsan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
114 views

Application of BooleApplication of Boolean Algebra - Pptan Algebra

This document discusses Boolean algebra and its application to simplifying logic circuits and expressions. It introduces Boolean algebra and its use in logic circuit design. It then provides 32 Boolean theorems and properties. Examples are given to demonstrate simplifying logic expressions using Boolean algebraic techniques like absorption, distribution, and DeMorgan's laws. The goal of simplification is to arrive at more efficient circuit implementations using fewer literals, terms, and logic gates. Tutorial problems are also provided to prove theorems and further simplify expressions.

Uploaded by

Riheen Ahsan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 10

Application of Boolean Algebra to Logic Circuits

Introduction

- Boolean algebra is an algebra of logic. Named after George Boole and developed in 1854 - First serious application - in telephone switching in 1939 by Shannon. - Boolean Algebra is governed by rules and axioms which enable logic equations to be manipulated.

- Useful for simplifying logic expressions or transforming them into other equivalent expressions

ICS217-Digital Electronics - Part 1.2 Combinational Logic

Boolean Relations (Properties and Identities)


Boolean Postulates 1. 00 = 0 2. 01 = 0 Derived from AND 3. 10 = 0 4. 11 = 1 5. 0+0 = 0 6. 0+1 = 1 Derived from OR 7. 1+0 = 1 8. 1+1 = 1 9. 0 = 1 Derived from NOT 10. 1 = 0 NB: notation convention A == A

ICS217-Digital Electronics - Part 1.2 Combinational Logic

Boolean Relations (Properties and Identities)


Boolean Theorems NB: X,Y,Z are boolean 1. 0X = 0 variable 2. X0 = 0 Properties of AND 3. 1X = X 4. X1 = 1 5. X+0 = X 6. 0+X = X Properties of OR 7. X+1 = 1 8. 1+X = 1 9. XX = X 10. XX = 0 Combining a variable with itself or its compliment 11. X+X = X 12. X+X = 1 Double compliment 13. X = X
ICS217-Digital Electronics - Part 1.2 Combinational Logic 3

Boolean Relations (Properties and Identities)


14. X+Y = Y+X 15. XY = YX Commutative laws

16. X(YZ) = (XY)Z = XYZ 17. (X+Y)+Z = X+(Y+Z) = X+Y+Z

Associative laws

18. X(Y+Z) = XY+XZ 19. X+YZ = (X+Y)(X+Z)


20. X+XY = X 21. X(X+Y) = X 22. XY+XY = X 23. (X+Y)(X+Y) = X

Distributive laws

Absorption laws

ICS217-Digital Electronics - Part 1.2 Combinational Logic

Boolean Relations (Properties and Identities)


24. (a) X+XY = X+Y (b) XZ+ZXY = ZX+ZY 25. X(X+Y) = XY 26. (Z+X)(Z+X+Y) = (Z+X)(Z+Y) 27. XY+XZ+YZ = XY+XZ 28. (X+Y)(X+Z)(Y+Z) = (Y+X)(X+Z) 29. XY + XZ = (X+Z)(X+Y) 30. (X+Y)(X+Z) = XZ + XY 31.[XYZ] = X+Y+Z+... 32. [X+X+Z+] = XYZ... DeMorgans Theorem

ICS217-Digital Electronics - Part 1.2 Combinational Logic

Simplification of Logic expressions using Boolean Algebra


Example 1. Simplify the logic expression: XYZ+XYZW+XZ XYZ(1+W)+XZ = XYZ+XZ = XZ(Y+1) = XZ Example 2. Simplify the logic expression: XYZ+XYZ+XY XZ(Y+Y)+XY = XZ+XY

ICS217-Digital Electronics - Part 1.2 Combinational Logic

Simplification of Logic expressions using Boolean Algebra


Example 3. Simplify the circuit.

A
F B

F = [(AB).B]
= (AB)+B = B+AB = (B+A).(B+B) by Thm 19 by DeMorgans Thm

= (B+A).1
= B+A
ICS217-Digital Electronics - Part 1.2 Combinational Logic

A B

Simplification of Logic expressions using Boolean Algebra


- Simplification should lead to a more economical or optimal hardware implementation - Three criteria to determine a minimal or simpler logic circuit: 1. Expression with fewest literals (binary variables) 2. Expression with fewest terms 3. Expression requiring least number of logical units in its cicuit implementation

ICS217-Digital Electronics - Part 1.2 Combinational Logic

Tutorial 1.2
1. Prove theorem 23. (X+Y)(X+Y) = X 2. Prove theorem 27. XY+XZ+YZ = XY+XZ 3. Prove the following: (a) (A+B)= A.B (b) (A+B)(A+C) = A+BC 4. Using Boolean algebra simplify each of the following logic expressions as much as possible: (i) Z = A(A+AB)(A+ABC)(A+ABCD) (ii) B = (XY)(YZ) (iii) C = (X1X2+X2X3)
NB: Two ways of proving the above problems: (a) use the theorems themselves (b) use a truth table

ICS217-Digital Electronics - Part 1.2 Combinational Logic

Tutorial 1.2
5. Draw the simplest possible logic diagram that implements the output of the logic diagram given below.

6. Write the logic expression and simplify it as much as possible and draw a logic diagram that implements the simplified expression.

ICS217-Digital Electronics - Part 1.2 Combinational Logic

10

You might also like