2.

2 Perform operations with Boolean Algebra

LOGIC GATES, TRUTH TABLE, AND ITS OPERATIONS

What is Logic Gates?

Logic

gates in binary system is use to represent process and operation for binary information in matematic.

AND Function
Text Description Output Y is TRUE if inputs A AND B are TRUE, else it is FALSE. Logic Symbol
A
AND

B
INPUTS OUTPUT

Truth Table

A 0 0 1 1

B 0 1 0 1

Y 0 0 0 1
AND Symbol

AND Gate Truth Table

Boolean Expression Y = A x B = A B = AB

OR Function
Text Description Output Y is TRUE if input A OR B is TRUE, else it is FALSE. Logic Symbol
A B
INPUTS OUTPUT
OR

Truth Table

A 0 0 1 1

B 0 1 0 1

Y 0 1 1 1

OR Gate Truth Table

OR Symbol

Boolean Expression Y = A + B

NOT Function (inverter)

Text Description Output Y is TRUE if input A is FALSE, else it is FALSE. Y is the inverse of A. NOT Y Logic Symbol A
INPUT OUTPUT

Truth Table

A 0 1

Y 1 0

NOT Gate Truth Table

Boolean Expression Y = A

NOT Bar

Alternative Notation

Y = A Y = !A

NAND Function
Text Description Logic Symbol
A
NAND

Output Y is FALSE if inputs A AND B are TRUE, else it is TRUE.

Y A bubble is an inverter This is an AND Gate with an inverted output

B
INPUTS OUTPUT

Truth Table

A 0 0 1 1

B 0 1 0 1

Y 1 1 1 0

NAND Gate Truth Table

Boolean Expression Y = A x B = AB

NOR Function
Text Description Logic Symbol
A
NOR

Output Y is FALSE if input A OR B is TRUE, else it is TRUE.

Y A bubble is an inverter. This is an OR Gate with its output inverted.

B
INPUTS OUTPUT

Truth Table

A 0 0 1 1

B 0 1 0 1

Y 1 0 0 0

NOR Gate Truth Table

Boolean Expression Y = A + B

Symbol:
A C B

Ex-OR
Output C is FALSE if inputs A and B are same value, else output is TRUE.

Get Exclusive (EX-OR)

INPUTS OUTPUT

Truth Table

A 0 0 1 1

B 0 1 0 1

C 0 1 1 0

EX-OR Gate Truth Table

Boolean Expression

Symbol:
A B C

Ex-NOR
Output C is TRUE if inputs A and B are same value, else output is FALSE.

Get Exclusive (EX-NOR)

INPUTS OUTPUT

Truth Table

A 0 0 1 1

B 0 1 0 1

C 1 0 0 1

EX-NOR Gate Truth Table

Boolean Expression

Circuit-to-Truth Table Example

A B
AND OR

NOT

AND

2# of Inputs = # of Combinations 23 = 8

A 0 0 0 0 1 1 1 1

B C 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1

Circuit-to-Truth Table Example

0 A 0 B 1
AND

0
AND

0
OR
NOT

A 0 0 0 0 1 1 1 1

B C 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1

Y 0

Circuit-to-Truth Table Example

0 A 0 B 1
AND

0
AND

1
OR
NOT

A 0 0 0 0 1 1 1 1

B C 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1

Y 0 1

Circuit-to-Truth Table Example

0 A 1 B 1
AND

0
AND

0
OR
NOT

A 0 0 0 0 1 1 1 1

B C 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1

Y 0 1 0

Circuit-to-Truth Table Example

0 A 1 B 1
AND

0
AND

1
OR
NOT

A 0 0 0 0 1 1 1 1

B C 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1

Y 0 1 0 1

Circuit-to-Truth Table Example

1 A 0 B 0
AND

0
AND

0
OR
NOT

A 0 0 0 0 1 1 1 1

B C 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1

Y 0 1 0 1 0

Circuit-to-Truth Table Example

1 A 0 B 0
AND

0
AND

0
OR
NOT

A 0 0 0 0 1 1 1 1

B C 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1

Y 0 1 0 1 0 0

Circuit-to-Truth Table Example

1 A 1 B 0
AND

1
AND

1
OR
NOT

A 0 0 0 0 1 1 1 1

B C 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1

Y 0 1 0 1 0 0 1

Circuit-to-Truth Table Example

1 A 1 B 0
AND

1
AND

1
OR
NOT

A 0 0 0 0 1 1 1 1

B C 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1

Y 0 1 0 1 0 0 1 1

Circuit-to-Boolean Equation
A
AND

AB Y =AB + AC

A
NOT

OR

AND

AC

A 0 0 0 0 1 1 1 1

B C 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1

Y 0 1 0 1 0 0 1 1

A - O - I Logic
A
AND

B
OR

NOT

AND

AND Gates OR Gates INVERTER Gates

Other Logic Arrangements:

NAND - NAND Logic NOR - NOR Logic

NAND Gate Special Application

S
NAND

S 0 1

T 1 0

A
NAND

Y
OUTPUT

B
INPUTS

Equivalent To An Inverter Gate

A 0 0 1 1

B 0 1 0 1

Y 1 1 1 0

NOR Gate - Special Application

S
NOR

S 0 1 1

T 1 0

A
NOR

B
INPUTS OUTPUT

Equivalent To An Inverter Gate

A 0 0 1 1

B 0 1 0 1

Y 1 0 0 0