An effective algorithm for optimal PLA column folding

Abstract We develop a heuristic algorithm for optimal PLA column folding. The algorithm consists of two parts: First, the column intersection graph associated with the PLA is min-cut partitioned. Then we can consider this folding problem on a bipartite graph. We shall prove two theoretical results which characterize an optimal folding on a bipartite graph. Generalizing these results, we have a heuristic which is both effective in finding optimal solutions and fast enough to handle large PLAs. Test results on this heuristic algorithm will be reported.

[1]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[2]  T. C. Hu,et al.  Optimum Reduction of Programmable Logic Array , 1983, 20th Design Automation Conference Proceedings.

[3]  Glen G. Langdon,et al.  Computer Design , 1982 .

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

[5]  Chien-Chih Chen,et al.  A Heuristic Algorithm for PLA Block Folding , 1985, DAC 1985.

[6]  Darrell Makarenko,et al.  A Statistical Analysis of PLA Folding , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[8]  C. L. Liu,et al.  Bipartite Folding and Partitioning of a PLA , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Omar Wing,et al.  Interval-graph-based PLA folding , 1985, Integr..

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

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

[12]  Leon I. Maissel,et al.  An Introduction to Array Logic , 1975, IBM J. Res. Dev..

[13]  Alberto L. Sangiovanni-Vincentelli,et al.  Multiple Constrained Folding of Programmable Logic Arrays: Theory and Applications , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.