Title :
A Depth-First Branch-and-Bound Algorithm for Optimal PLA Folding
Author_Institution :
Fachbereich Informatik, Universitaet Hamburg, Hamburg, W. Germany
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 :
Application software; Application specific integrated circuits; Binary codes; Combinational circuits; Control systems; Design automation; Heuristic algorithms; Polynomials; Programmable logic arrays; Very large scale integration;
Conference_Titel :
Design Automation, 1982. 19th Conference on
Conference_Location :
Las Vegas, NV, USA
Print_ISBN :
0-89791-020-6
DOI :
10.1109/DAC.1982.1585492
