Abstract
A simulated-annealing programmable-logic array (PLA) folding algorithm is presented for simple as well as multiple-column folding. Experimental results indicate that the algorithm performs very well. In many test problems, the results are superior to those produced by the well-known heuristic algorithm of G. De Micheli and A. Sangiovanni-Vincentelli (1983). It is also shown that the algorithm can be extended to handle constrained folding.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
