We present in this paper a simulated-annealing programmable-logic-array (PLA) folding algorithm for simple as well as multiple column folding. Experimental results indicate that our algorithm performs very well. In many test problems, our results are superior to those produced by the well-known heuristic algorithm due to De Micheli and Sangiovanni. We also show how our algorithm can be extended to handle constrained folding.
ASJC Scopus subject areas
- Electrical and Electronic Engineering