1. Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design

2. Lecture 4 outline Review of last Lecture Simplification using Boolean Algebra More simulation Karnough Map Introduction to combinational logic circuits

3. Review of Last Lecture DeMorag Theorem Introduction to simulation of digital circuits Simulation of AND, OR, NOT, Ex-OR, NAND gates

4. Simplification using Boolean Algebra In the application of Boolean algebra, we have to reduce a particular expression to its simplest form and then use the simplified expression to implement our digital circuit. For Example: Simplify the following expression. AB + A(B + C) + B (B + C)

5. Circuit diagram using original expression

6. Circuit diagram using simplified expression

7. Another Example Simplify the following, AB + AC + A _ B _ C

8. Main Points Simplification using Boolean Algebra Continuation of simulation for OR, NOT, Ex-OR, NAND gates

9. The End Thank you for your attention.