COMPUTER HARDWARE

Flora James
What are logic Gates?
Gates are digital circuits which operate one or more
input signals and produces an output signal
Basic Gates : And, Or and Not
Not Gate(Inverter gate)
An inverter is a gate with only one input and one output
signal; the output is always the opposite of the input
signal

X X’
0 1
1 0
OR Gate X Y Z F

The OR gate has two or more 0 0 0 0

0 0 1 1
input signals but only one 0 1 0 1
output signal. If any of the input 0 1 1 1
signal is high(1) then the output 1 0 0 1

signal is high(1) 1 0 1 1
1 1 0 1
1 1 1 1

X Y F
0 0 0 X
X
0 1 1 F

1 0 1 Y
1 1 1 F
Z
Y
F= X + Y
F= X V Y
AND gate X Y Z F
The AND gate can have two or more 0 0 0 0
input signals and produce one output 0 0 1 0
signal. When all the inputs are high(1)
0 1 0 0
then the output is high or 1 otherwise
0 1 1 0
the output is 0
1 0 0 0
1 0 1 0
X Y F
1 1 0 0
0 0 0
1 1 1 1
0 1 0
1 0 0 X X
1 1 1 F
F
Y

Z
Y
F= X · Y
F= X ^ Y
NOR gate X Y Z F
The NOR gate has two or more 0 0 0 1
input signals abut only only one 0 0 1 0
output signal. If all the inputs are 0 1 0 0
0 then the output signal is 1.
0 1 1 0
NOR gate is nothing but an
1 0 0 0
inverted OR gate.
1 0 1 0
1 1 0 0
1 1 1 0
X Y F
0 0 1
0 1 0
X F
1 0 0
1 1 0 X
Y Y
Z
F=(X + Y)’
NAND gate: X Y Z F
NAND gate is an inverted AND 0 0 0 1
gate.For all 1 inputs, it produces 0 , 0 0 1 1
otherwise for any other input 0 1 0 1
combination it produces a 1 output. 0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 0
X Y F
0 0 1 X X
X F F
0 1 1
Y
1 0 1 Y Y
Z
1 1 0
F= (X · Y)’
XOR Gate X Y Z F
The Exclusive OR gate has two or 0 0 0 0
more inputs but produces one 0 0 1 1
output signal. The XOR gate 0 1 0 1
produces output 1 for only those 0 1 1 0
input combinations that have odd 1 0 0 1
number of 1.
1 0 1 0
1 1 0 0
1 1 1 1
X Y F
0 0 0
0 1 1
1 0 1
1 1 0

F =X  Y
F= XY’+X’Y
Exclusive NOR gate. X Y Z F
The XNOR is logically 0 0 0 1
equal to an inverted XOR 0 0 1 0
gate. XNOR produces 1
0 1 0 0
when the combinations are
0 1 1 1
even number of 1.
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 0
X Y F
0 0 1
0 1 0
1 0 0
1 1 1
F=X  Y
F=(X’+Y) · (X+Y’)
Circuit Diagram:
Boolean algebra is useless unless it can be translated into
hardware, in the form of gates. This translation of Boolean
algebra in the gates form is known as logic gates.
Logic gates can be diagrammatically represented using
traditional symbols of gates.
Draw a circuit to realize the following : F(A,B,C)=AB+AC’+B’A’C

A
C’

A’
B’
C
NAND and NOR are called as Universal gates:
NAND and NOR can be used to design any gates. They are
preferred because they are less expensive and easier to design.
AND using NAND gate:
X
(X.Y)’ X.Y

X·Y =(X NAND Y) NAND (X NAND Y)

(X·Y)’= (X·Y)’ = X’+Y’ using de morgan’s

=(X’+Y’)NAND (X’+Y’)
=((X’+Y’)’ · (X’+Y’))’
=(X’+Y’)’ +(X’+Y’)’ (a.b)’=a’+b’
=X’’· Y’’ +X’’ ·Y’’ Demorgan’s
=X·Y+X·Y a’’ =a
=X·Y a+a=a
OR from NAND

X (X·X)’

X+Y

( Y·Y)’
XNAND X= (X.X)’
=X’+X’
=X’

X+Y= (X NAND X) NAND (Y NAND Y)

=X’ NAND Y’
=(X’· Y’)’
=X’’+Y’’
X+Y
X X’

NOT X = X NAND X
=(X·X)’
=X’+X’
=X’
How to draw using NAND gates
1. Derive simplified sum of products expression
2. Draw a circuit diagram using AND OR gates
3. Just replace AND and OR gates with NAND gate

F=ABC+AB
Draw a circuit diagram using NAND:
1. YZ +XZ
2. AB+BC+CD
3. AB’C+C’B
 A

B’

C
AB’C+C’B
C’

B
 NOR to NOR Logic

OR operation
A+B= (A NOR B) NOR (A NOR B)

A
(A+B)’ A+B

B
 AND operation
A·B=(A NOR A) NOR (B NOR B)

A’
A
A·B

B’
B
NOT operation
A’=A NOR A

A
A’
Design rule for NOR to NOR logic network

1. Derive a simplified POS form of the expression

2. Draw a circuit diagram using OR, AND gate
3. Finally substitute NOR gates for OR and AND gate

(X+Y)·(Y+Z)·(Z+X)
1.(A’+B’+C’) (A+B’+C)(A+B+C’)
2.A(B’+C)
 1. (A’+B’+C’) (A+B’+C)(A+B+C’)

A’
B’
C’ (A’+B’+C’) (A+B’+C)(A+B+C’)
A
B’
C
A
B
C’