Vol.2 No.1, pp.43-57 (January 1986)

A Heuristic Algorithm for

PLA Block Folding

Y. S. Kuo and C. Chen^{*}

* Institute of Information Science,
Academia Sinica,
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.

- Deterministic Chinese Parsing Using Formal Semantics

- A Heuristic Algorithm for PLA Block Folding

- To Develop A Relational Data-Knowledge Base System For Solving Decision Problems With Large Data

- A New Pyramid Architecture for Bottom-Up Image Analysis

- 3-D Object Recognition by Line Features Using Binocular Images