Title :
A Branch and Bound Algorithm for Optimal PLA Folding
Author :
Lewandowski, J.L. ; Liu, C.L.
Author_Institution :
Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL
Abstract :
In this paper we present a branch and bound algorithm which exhaustively searches for an optimal column and/or row folding of PLAs. For PLAs with up to 50-60 input/output lines we can obtain an optimal solution in no more than a few minutes.
Keywords :
Branch and Bound Algorithms; PLA-Folding; PLA-Minimization; Algorithm design and analysis; Computer science; Costs; Heuristic algorithms; Input variables; NP-complete problem; Physics computing; Programmable logic arrays; Software algorithms; Software packages; Branch and Bound Algorithms; PLA-Folding; PLA-Minimization;
Conference_Titel :
Design Automation, 1984. 21st Conference on
Print_ISBN :
0-8186-0542-1
DOI :
10.1109/DAC.1984.1585832
