A Heuristic Algorithm for PLA Block Folding
Y. S. Kuo and C. Chen* Institute of Information Science, Academia Sinica, Taiwan, Republic of China, * Institute of Computer Engineering, National Chiao Tung University, Taiwan, Republic of China
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.