Agenda

Fundamentals
 Logic Gates, Truth Tables, Logic Equations, and Schematics
Positive and Negative Logic
Logic Properties
More Logic
 Latches, Edge Triggers, Timers
Examples
OR Gate

A
X
B

A B X A B
0 0 0
0 1 1
1 0 1
1 1 1
X X

X=A+B
AND Gate

A
X
B

A B X
0 0 0
0 1 0 B
1 0 0
1 1 1
X X

X=A*B
NOT Gate (Inverter)

A X

A X
0 1
1 0

X X

X = !A
Gate Variations

OR +

OR
Inverted Inputs

A
B X
C

A B C X
0 0 0 1
0 0 1 0 A B C
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1 X X

X = A + B + !C
Inverted Outputs

A
B X
C

A B C X
0 0 0 0
0 0 1 1 A B C
0 1 0 0
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 0
1 1 1 0 X X

X = ! (A + B + !C)
Positive and Negative Logic

A A
B
X
= B
X

A B X A B X
0 0 1 0 0 1
0 1 1 0 1 1
1 0 1 1 0 1
1 1 0 1 1 0

X = !A + !B X = !(A * B)
Positive and Negative Logic

A A
B
X
= B
X

A B

X X X X
Positive and Negative Logic

A A
B
X
= B
X

A B X A B X
0 0 1 0 0 1
0 1 0 0 1 0
1 0 0 1 0 0
1 1 0 1 1 0

X = !A * !B X = !(A + B)
Positive and Negative Logic

A A
B
X
= B
X

A B

X X X X
Logic Gates
AND
Most common for protection and
OR control
NOT
NAND Universal Gates
NOR Very important for hardware design

XOR
XNOR
Logic Properties
Commutative Property:
 X=A+B=B+A
 X=A*B=B*A

Associative Property:
 X = (A + B) +C = A + (B + C)
 X = (A * B) * C = A * (B * C)

Distributive Property:
 X = A * (B + C) = A * B + A * C
Logic Precidence
Math:
 My Dear Aunt Sally = Multiply -> Divide -> Add -> Subtract
· 2 + 3 x 4 = ??
· 2 + 3 x 4 = 2 + (3 x 4) = 14
· 2 + 3 x 4 ≠ (2 + 3) x 4 = 20

Logic:
 NOT -> AND -> OR
· X = A + B * C = A or B and C
· X = A + B * C = A + (B * C)
· X = A + B * C ≠ (A + B) * C
Combining Gates

A A
B X B
X
C C

A B C X A B C X
0 0 0 0 0 0 0 0
0 0 1 0 0 0 1 0
0 1 0 0 0 1 0 0
0 1 1 1 0 1 1 1
1 0 0 1 1 0 0 0
1 0 1 1 1 0 1 1
1 1 0 1 1 1 0 0
1 1 1 1 1 1 1 1

X = A + (B * C) = A + B * C X = (A + B) * C = A + B * C
Latches
L

SET

RST

A (SET) A (SET)
L L
B (RST) B (RST)

L = (A + L) * !B L = A + (L * !B)

RESET DOMINANT LATCH SET DOMINANT LATCH

Latches

SET
A L
RST

SETL = A * !L

RSTL = A * L
Edge Triggers

L
SET
A L
RST

SETL = /A * !L

RSTL = /A * L
Timers
X
2
A XT
0

X=A
XPU = 2
XDO = 0

XT

0 1 2 3 4 5 6 7 8 9 10
Timers
X
2
A XT
0

X=A
XPU = 2
XDO = 0

XT

0 1 2 3 4 5 6 7 8 9 10
Timers
X
0
A XT
3

X=A
XPU = 0
XDO = 3

XT

0 1 2 3 4 5 6 7 8 9 10
Timers
X
2
A XT
3

X=A
XPU = 2
XDO = 3

XT

0 1 2 3 4 5 6 7 8 9 10
Timers
X
0
TRIP OUT1
9

X = TRIP
OUT1 = XT
XPU = 0 cycles
XDO = 9 cycles

X
0 OUT1
TRIP
9

OUT1 = XT OR TRIP
Timers

X
0
TRIP OUT1
9

52a

X = TRIP
OUT1 = TRIP + XT + 52a * OUT1
XPU = 0
XDO = 9
Complete Logic

X L
3 SET
A L
0 RST

X=A
XPU = 3 seconds
XDO = 0 seconds
SETL = /XT * !L
RSTL = /XT * L
Questions?

There are 10 types of people in the world...

those who understand binary, and those who don’t.

Brent Carper, PE
Engineering Manager – Relay Application Innovation, Inc.
Adjunct Professor – Washington State University
Brent.C@RelayApplication.com
509-334-9138