Digital Electronics

Lecture 4

Simplification using Boolean Algebra, Combinational Logic Circuit Design

Lecture 4 outline

Review of last Lecture Simplification using Boolean Algebra More simulation

Karnough Map Introduction to combinational logic circuits

Review of Last Lecture

DeMorag Theorem Introduction to simulation of digital circuits Simulation of AND, OR, NOT, Ex-OR, NAND gates

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)

Circuit diagram using original expression

A

AB AB + A(B + C) + B(B + C)

B C

A(B + C)

B(B + C)

Circuit diagram using simplified expression

A C B AC AC + B

Another Example

Simplify the following,

AB + AC + A B C

Main Points

Simplification using Boolean Algebra Continuation of simulation for OR, NOT, Ex-OR, NAND gates

The End
Thank you for your attention.