A Heuristic Algorithm for PLA Block Folding

The folding of programmable logic array (PLA) is considered. We develop a heuristic algorithm for optimal block folding. The algorithm is based on the column intersection graph associated with the PLA. Then the techniques of graph partitioning and two-objective linear programming are applied. Test results will be demonstrated to show the effectiveness of the algorithm.

[1]  S. Vajda,et al.  Integer Programming and Network Flows , 1970 .

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

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

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

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

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

[7]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .