Difficulty: Easy
Correct Answer: All of the above
Explanation:
Introduction / Context:An FPLA is an early but important programmable logic architecture that predates large-scale FPGAs. Understanding its internal structure helps clarify differences between PLAs, PALs, and GALs, and why certain Boolean forms map efficiently to particular devices.
Given Data / Assumptions:
Concept / Approach:In a PLA, both the AND and OR arrays are programmable. The AND plane generates product terms from inputs and their complements, and the OR plane sums any subset of those products to create outputs. Because configuration determines connectivity rather than stored user data, an FPLA is considered a nonmemory programmable logic device (its programmability defines logic structure, not runtime data storage).
Step-by-Step Solution:
Recognize that FPLA ≈ PLA with field programmability.Confirm that the AND plane is programmable to form required product terms.Confirm that the OR plane is programmable to combine products into outputs.Note that it is not “memory” in the sense of RAM/ROM used for data storage.Verification / Alternative check:Textbook diagrams show both planes as programmable matrices with fusible links; device programming files specify which intersections are connected.
Why Other Options Are Wrong:
Common Pitfalls:Confusing PLAs (programmable OR+AND) with PALs (programmable AND + fixed OR) and assuming identical resource limits.
Final Answer:All of the above
Discussion & Comments