Title :
Optimal Bipartite Folding of PLA
Author :
Egan, J.R. ; Liu, C.L.
Author_Institution :
University of Illinois at Urbana-Champaign, Urbana, IL
Abstract :
The notion of a bipartite folding of a PLA is introduced. An efficient branch and bound algorithm is presented which finds an optimal bipartite folding of a PLA. The experimental results give additional justification to this folding technique.
Keywords :
Algorithm design and analysis; Circuits; Complexity theory; Computer science; Costs; Heuristic algorithms; Logic arrays; Logic design; 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.1585493
