Boolean Algebra and Reduction Techniques

Annisa Nur Rasyida Rana Bouzida Sabrina Hikmah Ramadianti Yuli Dewi Pratiwi

Overview
Combinational Logic

Boolean Algebra

The Morgans Theorem

Combinational Logic
X AB AC BC C

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

X 0 0 0 0 0 1 0 1

X AB AC BC C X AC

Boolean Algebra
Boolean Laws

Boolean Rules
Simplification

Boolean Algebra Laws

equivalent

equivalent Commutative Law

Addition A + B = B + A Commutative Law of Multiplication AB = BA

Addition

Associative Law

Associative Law of Addition equivalent equivalent equivalent Addition A + (B + C) = (A + B) + C

Multiplication A(BC) = (AB)C

Distributive Law
A(B + C) = AB + AC

Commutative Law of Multiplication

Associative Law of Multiplication Distributive Law

Boolean Algebra Rules

A.0=0 A.1=A A+0=A A+1=1

A.A=A

A+A=A

AA=0

A+A=1

A=A

A+AB=A+B

A+AB=AB

Simplifications
X AB AC BC C

X AB AC BC C X AC
X AB AC BC C X AB AC C B 1 X AB AC C
X ABC ACC X ABC AC

Distributive Rules 4 Distributive Rules 5 Distributive Rules 4

X AC B 1
X AC

De Morgans Theorem

A.B=A+B

A+B=A.B

Entering a Truth Table in VHDL using Vector Signal

Make a truth table
Enter the input to the VHDL

The FPGA

The Universal Capability of NAND and NOR Gates

NAND NAND Inverter NOR

NAND OR

NAND inverter NAND AND NAND OR NAND AND NAND NOR

A.B=AB

A+A=A

X=A.B=A+B NOR inverter OR INVERTER

X=A.B=A+B A+B

NOR AND NOR OR NOR NAND NAND NOR

AND-OR-INVERT Gates for Implementing Sum of Product Expressions

Product of Sums (POS) Form

X=AB . CD OR-OR-OR ANDed X= A+B . C+D

X=AB+CD

Sum of Products (SOP) Form

AND-AND-AND ORed

X=AC+AD+BC+BD

Karnaugh Mapping

2. 3. 1.

EXAMPLE

CD CD AB AB AB AB 1 1 1 1

CD 1

CD 1

W = BCD+ABD+ABC+ABCD
AB

BCD

Yeaaaahhh! We get it

W = AB+BC+BCD
BC

System Design Application