Multiple Constrained Folding of Programmable Logic Arrays: Theory and Applications
- 1 July 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 2 (3), 151-167
- https://doi.org/10.1109/tcad.1983.1270033
Abstract
Programmable logic arrays are important building blocks of VLSI circuits and systems. We address the problem of optimizing the silicon area and the performances of large logic arrays. In particular, we describe a general method for compacting a logic array defined as multiple row and column folding and we address the problem of interconnecting a PLA to the outside circuitry. We define a constrained optimization problem to achieve minimal silicon area occupation with constrained positions of electrical inputs and outputs. We present a new computer program, PLEASURE, which implements several algorithms for multiple and/or constrained PLA folding.Keywords
This publication has 9 references indexed in Scilit:
- An Algorithm for Optimal PLA FoldingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1982
- Techniques for programmable logic array foldingPublished by Association for Computing Machinery (ACM) ,1982
- Optimization of the PLA AreaPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Design of Large ALUs Using Multiple PLA MacrosIBM Journal of Research and Development, 1980
- A High Density Programmable Logic Array ChipIEEE Transactions on Computers, 1979
- An associative logic matrixIEEE Journal of Solid-State Circuits, 1976
- An Introduction to Array LogicIBM Journal of Research and Development, 1975
- MINI: A Heuristic Approach for Logic MinimizationIBM Journal of Research and Development, 1974
- Optimal Sequencing of a Single Machine Subject to Precedence ConstraintsManagement Science, 1973