Analysis of Minimization Algorithms for Multiple-Valued Programmable Logic Arrays
NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF ELECTRICAL AND COMPUTER ENGINEERING
Pagination or Media Count:
We compare the performance of three heuristic algorithms 3,6,13 for the minimization of sum-of-products expressions realized by the newly developed multiple-valued programmable logic arrays 9. Heuristic methods are important because exact minimization is extremely time consuming. We compare the heuristics to the exact solution, showing that heuristic methods are reasonably close to minimal. We use as a basis of comparison the average number of product terms over a set of randomly generated functions. All three heuristics produce nearly the same average number of product terms. Although the averages are close, there is surprisingly little overlap among the set of functions where the best realization is achieved. Thus, there is a benefit to applying different heuristics and then choosing the best realization.
- Electrical and Electronic Equipment
- Theoretical Mathematics
- Operations Research