A heuristic algorithm for PLA block folding

Authors:
Y. S. Kuo;C. Chen;T. C. Hu
Affiliations:
Institute of Information Science, Academia Sinica, Taipei, Taiwan, Republic of China;Institute of Computer Engineering, National Chiao Tung University, Taiwan, R.O.C.;Dept. of EECS, University of California, San Diego, La Jolla, CA
Venue:
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Year:
1985

Citing 3
Cited 1

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Optimum reduction of programmable logic array

DAC '83 Proceedings of the 20th Design Automation Conference
Techniques for programmable logic array folding

DAC '82 Proceedings of the 19th Design Automation Conference

An LPGA with foldable PLA-style logic blocks

FPGA '98 Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.