DocumentCode
3143424
Title
A Depth-First Branch-and-Bound Algorithm for Optimal PLA Folding
Author
Grass, Werner
Author_Institution
Fachbereich Informatik, Universitaet Hamburg, Hamburg, W. Germany
fYear
1982
fDate
14-16 June 1982
Firstpage
133
Lastpage
140
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation, 1982. 19th Conference on
Conference_Location
Las Vegas, NV, USA
ISSN
0146-7123
Print_ISBN
0-89791-020-6
Type
conf
DOI
10.1109/DAC.1982.1585492
Filename
1585492
Link To Document