Heuristics for PLA folding: an analytical approach
Thesis/Dissertation
·
OSTI ID:5732778
A practical problem that arises in the automatic design and layout of Programmable Logic Arrays (PLA's) is examined. Folding is a technique used to reduce the area of PLA's. The problem of folding a PLA to its smallest possible area is known to be NP-Complete. The practical importance of this problem motivates the study of heuristics. So far, much of the work on heuristics for this problem has been of an experimental nature. Here an analytical study of heuristic algorithms for this problem is carried out. The performance measure used to evaluate a heuristic (referred to as the folding ratio of the heuristic) is the worst case ratio of the optimal value to the value produced by the heuristic. The results indicate very strongly that no polynomial time approximation algorithm can guarantee a constant worst case ratio for an arbitrary PLA. However, for restricted classes of PLA's, it is shown that constant ratios can be obtained in polynomial time. A variant of the folding problem (the orderability problem) is addressed, and some new results are presented.
- OSTI ID:
- 5732778
- Country of Publication:
- United States
- Language:
- English
Similar Records
Minimal covering problem and PLA minimization
Approximation algorithms for the discrete time-cost tradeoff problem
Best first search algorithm for optimal PLA folding and its implementation on virtual bit map processor
Journal Article
·
Sat Nov 30 23:00:00 EST 1985
· Int. J. Comput. Inf. Sci.; (United States)
·
OSTI ID:7231312
Approximation algorithms for the discrete time-cost tradeoff problem
Conference
·
Sun Jun 01 00:00:00 EDT 1997
·
OSTI ID:471707
Best first search algorithm for optimal PLA folding and its implementation on virtual bit map processor
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:6471786