Documente Academic
Documente Profesional
Documente Cultură
Logic Devices
Introduction
An IC that contains large numbers of gates, flip-flops,
etc. that can be configured by the user to perform
different functions is called a Programmable Logic
Device (PLD).
The internal logic gates and/or connections of PLDs can
be changed/configured by a programming process.
One of the simplest programming technologies is to use
fuses. In the original state of the device, all the fuses are
intact.
Programming the device involves blowing those fuses
along the paths that must be removed in order to obtain
the particular configuration of the desired logic function.
ADVANTAGES
less board space, faster, lower power requirements (i.e., smaller power supplies),
less costly assembly processes, higher reliability (fewer ICs and circuit
connections means easier troubleshooting), and availability of design software.
AND ARRAY
OR ARRAY
PAL
PROG.
FIXED
PROM
FIXED
PROG.
PLA
PROG.
PROG.
Inputs
Programmable
Connections
Programmable
OR array
Outputs
Inputs
Programmable
Connections
Programmable
AND array
Fixed
OR array
Outputs
Programmable
OR array
Outputs
Inputs
Programmable
Connections
Programmable
AND array
Programmable
Connections
Chapter 3 - Part 2
Alternative representation
Short-hand notation
so we don't have to
draw all the wires!
X at junction indicates
a connection
A B C D
AB
AB
CD
CD
F0 = A B + A B
F1 = C D + C D
Programmed device
AB+AB
CD+CD
A B C
ABC
Multiple functions of A, B, C
A
B
F1 = A B C
C
A
F2 = A + B + C
F3 = A B C
ABC
F4 = A + B + C
ABC
F5 = A B C
ABC
ABC
F6 = A B C
ABC
ABC
ABC
F1 F2 F3 F4 F5
F6
B
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1
C
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1
D
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
W
0
0
0
0
0
1
1
1
1
1
X
X
X
X
X
X
X
0
0
0
0
1
1
0
0
0
0
X
X
X
X
X
X
Y
0
0
1
1
1
1
1
1
0
0
X
X
X
X
X
X
Z
0
1
1
0
0
0
0
1
1
0
X
X
X
X
X
X
AB
00
CD
A
01
11
10
00
01
AB
00
CD
A
01
11
10
00
01
11
10
D
11
C
10
B
K-map for W
AB
00
CD
Minimized Functions:
B
K-map for X
A
01
11
10
00
01
AB
00
CD
A
01
11
10
00
01
11
10
D
11
W=A+BD+BC
X=BC
Y=B+C
Z=ABCD+BCD+AD+BCD
K-maps
C
10
B
K-map for Y
B
K-map for Z
A B
C D
A
BD
BC
Minimized Functions:
W=A+BD+BC
X=BC
Y=B+C
Z=ABCD+BCD+AD+BCD
BC
0
0
0
B
C
0
0
ABCD
BCD
AD
BCD
A
01
11
10
AB
00
CD
ABCD
01
11
10
00
00
01
01
11
11
10
ABCD
ABCD
D
ABCD
C
10
AC
AC
K-map for EQ
K-map for NE
BD
BD
AB
00
CD
A
01
11
10
AB
00
CD
A
01
11
10
ABD
00
00
BCD
01
01
ABC
11
11
10
10
D
C
BCD
B
K-map for LT
B
K-map for GT
EQ NE LT
GT