A Depth-First Branch-and-Bound Algorithm for Optimal PLA Folding
- 1 January 1982
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 133-140
- https://doi.org/10.1109/dac.1982.1585492
Abstract
In this paper we are concerned with the PLA folding problem defined by Hachtel, Newton and Sangiovanni-Vincentelli. We propose a depth first branch and bound procedure for optimizing simultaneous row and column folding. With our procedure one can compute such a PLA folding which is optimal with respect to different practical constraints. We present some results of an implemented algorithm that is restricted to row folding.Keywords
This publication has 4 references indexed in Scilit:
- Optimization of the PLA AreaPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- A Computer-Aided-Design System For Segmented-Folded PLA Macro-CellsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Design of Large ALUs Using Multiple PLA MacrosIBM Journal of Research and Development, 1980
- LOGEACM SIGDA Newsletter, 1979