A Best-First Search Algorithm for Optimal PLA Folding

In this paper we propose a new algorithm for optimal PLA folding based on a graph theoretic formulation. An efficient best-first search (BFS) algorithm is presented which finds a near-optimal PLA folding. The proposed algorithm first constructs the longest paths on the associated disjoint graph generated from the PLA personality matrix, and then extracts the ordered folding sets from the constructed paths. The algorithm is shown to be effective for most test cases.

[1]  Alberto Sangiovanni-Vincentelli,et al.  Techniques for Programmable Logic Array Folding , 1982, DAC 1982.

[2]  Werner Grass.  A Depth-First Branch-and-Bound Algorithm for Optimal PLA Folding , 1982, DAC 1982.

[3]  L. Pósa,et al.  Hamiltonian circuits in random graphs , 1976, Discret. Math..

[4]  J. L. Lewandowski,et al.  A Branch and Bound Algorithm for Optimal PLA Folding , 1984, 21st Design Automation Conference Proceedings.

[5]  Alberto L. Sangiovanni-Vincentelli,et al.  An Algorithm for Optimal PLA Folding , 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.