Fundamentals of Logic Design , Spring Semester, 2024

College Of Electronic Technology

Logic Gates & Boolean Algebra

AND logic Gate

Logic Symbol : IEEE Standard

Boolean Expression Truth Table

F ( A,B) = A . B A B F
F ( A,B) =A AND B 0 0 0
0 1 0
1 0 0
1 1 1

Timing Diagram Switching representation

S/A S/B Lamp/F

Open Open Off
Open close Off
close Open Off
close close ON

1Page Ismail Yusif

Fundamentals of Logic Design , Spring Semester, 2024

College Of Electronic Technology

Logic Gates & Boolean Algebra

OR Logic Gate

Logic Symbol : IEEE Standard

Boolean Expression Truth Table

F ( A,B) = A + B A B F
0 0 0
F ( A,B) =A OR B 0 1 1
1 0 1
1 1 1

Timing Diagram Switching representation

S/A S/B Lamp/F

Open Open Off
Open close On
close Open On
close close ON

2Page Ismail Yusif

Fundamentals of Logic Design , Spring Semester, 2024

College Of Electronic Technology

Logic Gates & Boolean Algebra

NOT logic Gate

Logic Symbol : IEEE Standard

Boolean Expression Truth Table

F ( A) = 𝐴̅ A F
0 1
F ( A) = NOT A 1 0

Timing Diagram Switching representation

volt

A
5
1 0
0 1
time
T1 T2 T3
volt

F
5
S/A Lamp /F
1
1 0 Off On
time On Off
T1 T2

3Page Ismail Yusif

Fundamentals of Logic Design , Spring Semester, 2024

College Of Electronic Technology

Logic Gates & Boolean Algebra

NOR logic gate

Logic Symbol IEEE Standard

A

F
B

Boolean Expression
Truth table
F ( A,B) = 𝐴 + 𝐵 A B F
F ( A,B) =A NOR B 0 0 1
0 1 0
1 0 0
1 1 0

Timing diagram Switching representation

S/A S/B Lamp/F

Open Open ON
Open Close OFF
Close Open OFF
Close Close OFF

4Page Ismail Yusif

Fundamentals of Logic Design , Spring Semester, 2024

College Of Electronic Technology

Logic Gates & Boolean Algebra

NAND gate

Logic Symbol : IEEE Standard

Boolean Expression Truth Table

F ( A,B) = 𝐴 . 𝐵 A B F
F ( A,B) =A NAND B 0 0 1
0 1 1
1 0 1
1 1 0

Timing Diagram Switching representation

S/A S/B Lamp/F

Open Open ON
Open close ON
close Open ON
close close OFF

5Page Ismail Yusif

Fundamentals of Logic Design , Spring Semester, 2024

College Of Electronic Technology

Logic Gates & Boolean Algebra

Universal Gates VS Basic logic gates

 OR, AND and NOT gates are the three basic logic gates as they together can be
used to construct the logic circuit for any given Boolean expression.

 NOR and NAND gates have the property that they individually can be used to
hardware-implement a logic circuit corresponding to any given Boolean
expression . That is, it is possible to use either only NAND gates or only NOR
gates to implement any Boolean expression. This is so because a combination of
NAND gates or a combination of NOR gates can be used to perform functions of
any of the basic logic gates. It is for this reason that NAND and NOR gates are
universal gates.

Implementation of basic logic gates using only NAND gates

Implementation of basic logic gates using only NOR gates

6Page Ismail Yusif

Fundamentals of Logic Design , Spring Semester, 2024

College Of Electronic Technology

Logic Gates & Boolean Algebra

Exclusive-OR / EX-OR / XOR Gate

ODD 1's Detector

Logic Symbol IEEE Standard

Boolean Expression Truth table

A B F
F ( A,B) = A xor B 0 0 0
F ( A,B) =𝐴̅B + 𝐵A 0 1 1
1 0 1
F ( A,B) =A ⊕ B 1 1 0
F(A,B) =(A +B)( 𝐴̅ +𝐵) 1. From the truth table how we can use
of XOR gate, as
a. Buffer " input same as
output "
b. controlled Inverter

Timing diagram Switching representation

S/A S/B Lamp/F

Open Open OFF
Open Close ON
Close Open ON
Close Close OFF

XOR Properties :
A ⊕ A = 0 , A⊕ A =1 , A ⊕ 0 = A , A ⊕1 = A
A ⊕A ⊕.........n = A if n is odd A ⊕A ⊕.........n = A if n is even .
if A ⊕ B =C then , A⊕ C =B , B ⊕ C =A and A ⊕B⊕C =0

7Page Ismail Yusif

Fundamentals of Logic Design , Spring Semester, 2024

College Of Electronic Technology

Logic Gates & Boolean Algebra

Exclusive-NOR / EX-NOR / XNOR Gate

Even 1's Detector

Logic symbol IEEE Standard

Boolean Expression
A B F
F(A,B) = 𝐴̅ 𝐵 + AB 0 0 1
F (A,B) = A EX-NOR B 0 1 0
F (A,B) = A XNOR B 1 0 0
1 1 1
F (A ,B) = A ⊕ B

Timing diagram Switching representation

S/A S/B Lamp/F

Open Open ON
Open Close OFF
Close Open OFF
Close Close ON

1. Can be implemented three inputs XNOR gate using two input XNOR?

2. Can be implemented four inputs XNOR gate using two input XNOR?

8Page Ismail Yusif

Fundamentals of Logic Design , Spring Semester, 2024

College Of Electronic Technology

Logic Gates & Boolean Algebra

Buffers and Transceivers

Some of the common applications of inverting and noninverting buffers are as
follows. Buffers are used to drive circuits that need more drive current. Non-inverting
buffers are also used to increase the fan-out of a given logic gate. This means that the
buffer can be used to increase the number of logic gate inputs to which the output of a
given logic gate can be connected. Yet another application of a non-inverting buffer is
its use as a delay line. It delays the signal by an amount equal to the propagation delay
of the device. More than one device can be connected in cascade to get larger delays.

9Page Ismail Yusif

Fundamentals of Logic Design , Spring Semester, 2024

College Of Electronic Technology

Logic Gates & Boolean Algebra

Axioms of Boolean Algebra

Boolean algebra: based on a set of rules derived from a small number of basic
assumptions

a. 0 .0 =0 e. 0 .1=1 .0=0
b. 1 +1= 1 f. 1 +0=0 +1= 1
c. 1 .1 =1 g. if x=0 then 𝑥̅ =1
d. 0 + 0=0 h. if x=1 then 𝑥̅ =0

 From the axioms are derived some rules for dealing with
single variable

a. X .0 =0
b. X +1 =1
c. X .1 =x Substitute the values
d. X +0 =X X=0 and X =1 into the
e. X .X =X Expression and verify
f. X +X=X Using the basic axioms
g. X.𝑋=0
h. X + 𝑋 =1
i. 𝑋 =X

Two & three variable properties

a. x . y = y .x Commutative
b. x+ y = y +x

c. x .( y .z ) = (x .y) .z Associative
d. x+(y +z) = (x + y) +z

e. x .( y +z) = x. y +x. z Distributive

f. x +y .z = (x+ y ) (x+ z)

g. x + x y = x
Absorption
h. x (x + y) = x

10Page Ismail Yusif

Fundamentals of Logic Design , Spring Semester, 2024

College Of Electronic Technology

Logic Gates & Boolean Algebra

i. x y + x𝑦 = x Combining
j. ( x + y ) ( x + 𝑦 ) = x

k. (𝑥. 𝑦) = 𝑥̅ + 𝑦
DeMorgan
l. (𝑥 + 𝑦) = 𝑥̅ . 𝑦 Theorem
m. x + 𝑥̅ y = x + y
n. x (𝑥̅ + y ) =x y

To prove : See reference book (Morris Mano) page 56 -64 chapter 2

11Page Ismail Yusif