Download as pdf or txt
Download as pdf or txt
You are on page 1of 8

DI PAL (Programmable Array Logic) .Dec.-04; 05.

·tS/May-05, 12

We have seen that PLA is a device with a programmable AND array and
programmable OR ·a rray. However, PAL programmable array logic· is a programmable
logic device with a fixe~ OR array and a programmable AND array. Because only AND
gates are programmable, the PAL is easier to program, but is not as flexible as the PLA.
Fig. 9.4.1 shows the array logic of a typical PAL. It has four inputs and four outputs.
Each input has buffer and an inverter gate. It is important to note that two gates are
shown with one composite graphic symbol with normal and complement outputs. There
are four sections. Each section has three programmable A.i.'1D ·gates and one fixed OR
gate. The output of section 1 is connected to a buffer-inverter gate and then fed back
into the inputs of the AND gates, through fuses. This allows the logic designer to feed
an output function back as an input variable to create a new function. -Such PALs· are
referred to as Programmable 1/0 PALs.
The commercial PAL devices has more gates than #le one shown in Fig. 9.4.1. A
typical PAL integrated circuit may have eight inputs, eight outputs, and eight sections,
each consisting of an eight wide AND-OR array. _
C C D D w w
A A 13 B
Product

te~s==i==i==t==t==t==t==t==~==f==t==j
2
w

3-1~+-H-t-+Tlr-7
A L-t======.=3~
4
X
5

6
All fuses intact
B (always= 0)
7

y
8

10

11 z
12
D

X Fuse intact

Fuse blown

Fig. 9.4.1 Array logic for typical PAL

lilll 1mplementation of Combinational Logic Circuit using PAL


Let us see the implementation of a combinational circuit using PAL with the help of
examples.
J.

5otution:
SteP 1 : Simplify the four fundions

11 1 1

10 1 1
x = A B D + ABC + AC .+ BCD - -- -
. y= ABC+ BCD +AC
w ::: A B D + ABC + AC

For z

z = ABO + BCD + BO

Fig. 9.4.2 k-map slmpllflcatlon


N .
. 0 te that function x has four product terms. Three of them are equal tow. Therefore
We can . - .
Wnte x=w+BCD. . .
Step 2 : Implementation
In the last- section we have tl).e PLA program table. The program table for PAL
is similar to PLA program table. Table 9.4.1 shows PAL- program table with product
terms, AND inputs and outputs.

A B c · o, w

0 0

0 1 1

.1 -0

l ,. l 0

0 0 J

0 1 0

9. 1 0

10. 0 0 1 _z = A a o+ sc o+ a o·

11 - 0 0 1

12 1 0

Table 9.4.1 PAL program table


A A ts i:s· C' D D' w w'

2 w

A
4
X
5

7
y
8

10
z
11

. 12
D

Fig. 9.4.3 Logic diagram

li&tu Oes.ign BCD to Exckss-3 conv~rte~ using PAL.


. . ., ,~ ..... ;Z . . . ,!. > .• , • • ,...;,~ ~.,ii,.;.~· •

Solution:

Stap 1 : Derive the truth table of BCD to Excess-3 converter


Decimal BCD code Excess-3 code

Table 9.4.2 Truth table for BCD to Excess-3 code converter

Step 2 : Simplify the Boolean functions


,
for Excess-3 .code outputs. I

__________
For E3. For E2
For E1
01 11 10 B3B2
B1B0.,...00 11 01 n 10
.
0 0 , 0 00 0 0
01 0 0
..•. ······t ...
! Xj ...
1

1
X

1
.... _..........__ 11 11 .x ~x .X
10 X
'"·
B
E1 = 1B0 + 81B0

BB For E0
. B3B 1 o
2
~, 00
01
.
00 : 1 I ·o
11 10
"' • - ~ 1
· o f 1 ii
1,
•.
01 ""1 0 0 1
r,
11 X X X X
10 U.J 0 X X
.,..___.,,

Fig. 9.4.4 K-map simplification


Inputs Outputs

'
B2, B1 8'0 Es
1 1

1
':\

J½ B1 Bo
" ~Bo

J½ B1
B1 Bo

B1 Bo

Table-9.4.3 PAL p~ogram table

·Eh B3 82 8 2 ' 8 1 8 1 ~o 80 ..

Eo

s,

Fig. 9.4.5 Logic diagram


)igitaJ Logic Circuits 9 - 36 Introduction to Programmable L .
- - . . . . ; . . . . - - - - - - - - - - - - - - - - - - - - - - - . . : . . og,cOet
" ·•· ·'·. -~. .
Example 9.4.3 Generate the following ..Boolean· ftmctions . wi'tlt ii ·.ij& · with 4· inputS
• • • •
' , , ,., • s .c •
t
-,
..
" ,
"'
Qb.l
'"'

• 4 outputs. , . · · · . · .··" r . ·.
,·... Y3 = ABCD +ABCD +ABCD, . Yi ~JfB~9 +A,BCD + A¥CD.~ t ..
~- \ ·y 1 =_ABC +ABC+ A}!C. +,AB~ ! Y8,~~
YlflfJJ~;:i . , •, . ·:;· ••Ml•ilMfltq
Solution:
Step 1 : Simplify the Boolean functions
Y = A B'C D ·+ A B C D
3
+A B C D =(A + A) B C D + A .B C D
= BCD+ABCD

Y2 = A B CD + A B C _
D + A B C D = A B C (D + D) + (A A) (BCD)

= ABC+BCD
Y1 = AB~+ABC+ABC+ABC
= A B (C + C) + A B C + (A + A) BC = A B + A BC + BC
Yo = Aa~o
Step 2 : Implementation

AA BB CC DD
. ,j '4

Yo
D

You might also like