UNIT - 5 - Part 1 - Memory
UNIT - 5 - Part 1 - Memory
⮚ The PROM has a fixed AND array constructed as a decoder and programmable
OR array. The programmable OR gates implement the Boolean functions in sum
of minterms.
⮚ The Programmable Array Logic (PAL) has a programmable AND array and a
fixed OR array. The AND gates are programmed to provide the product terms for
the Boolean functions which are logically summed in each OR gate.
⮚ The most flexible PLD is the Programmable Logic Array (PLA) where both AND
and OR arrays can be programmed. The product terms in the AND array may be
shared by any OR gate to provide the required sum of products implementation
THE PROGRAMMABLE ARRAY LOGIC (PAL)
• Programmable Array Logic (PAL) is a commonly used
programmable logic device (PLD).
• It has programmable AND array and fixed OR array.
Because only the AND array is programmable, it is
easier to use but not flexible as compared to
Programmable Logic Array (PLA).
• PAL’s only limitation is number of AND gates.
• PLAs implement two-level combinational logic in sum-
of-products (SOP) form. PLAs are built from an AND
array followed by an OR array, as shown in Figure .
• The inputs (in true and complementary form) drive an
AND array, which produces implicants, which in turn
are ORed together to form the outputs.
• An M × N × P-bit PLA has M inputs, N implicants,
and P outputs.
EXAMPLE SCHEMATIC OF A PAL
f 1 = X1 X2 X3‘ + X1‘ X2 X3
f 2 = X1’ X2‘ + X1 X2 X3
1. Using the connection abbreviations, redraw the circuit in figure to
show how it can be programmed to implement
F1 = ABC + AC + ABC & F2 = ABC + BC
• Solution:
Note that one unused AND
gate has all its links intact. All
links intact can be
represented by X in the AND
gate as shown in the fig.
PAL Programming Table
• PAL programming Table consists of 3 columns. The first column lists the
product terms numerically, the second column specifies the required paths
between inputs and AND gates and the third column specifies the outputs of
the OR gates.
• For each product term the inputs are marked with 1,0 or - .
• If a variable in a product term appears in its true form, the corresponding input
variable is marked with 1 and marked with 0 when the variable appears in
complemented form.
• If the variable is absent in product term its is marked as - .
• The parts between the inputs and the AND gates are specified under the column
heading inputs in the programming table.
• 1 in the input column specifies a connection from the input variable to the AND gate
and 0 input specifies a connection from the complement of the variable to the input
of the AND gate.
• A – specifies blown fuse in both the input variable and its complement. It is
assumed that open terminal in the input of an AND gate behaves like a 1.
• The outputs of the OR gates are specified under the output column.
PROGRAMMABLE LOGIC ARRAY (PLA)
• Structure of
unprogrammed PLA
Example : 1. Show how the PAL circuit as shown in fig, would be programmed to
implement the Sum and Carry of the full adder.
⮚ Solution :
1. Truth Table of Full-adder
2. Simplify the equation using K-map
3. Realization of Full-adder
PLA Programming Table
• PLA programming Table consists of 3 columns. The first column lists the product
terms numerically, the second column specifies the required paths between inputs
and AND gates and the third column specify the paths between AND & OR gates.
• For each output variable, may have True (T) and complimented (C) for
programming EX-OR gate.
• For each product term the inputs are marked with 1,0 or - .
• If a variable in a product term appears in its true form, the corresponding input
variable is marked with 1 and marked with 0 when the variable appears in
complemented form. If the variable is absent in product term its is marked as - .
PROBLEMS ON PAL AND PLA