Analysis of minimization algorithms for multiple-valued programmable logic arrays
Loading...
Authors
Tirumalai, Parthasarathy
Butler, Jon T.
Subjects
Advisors
Date of Issue
1988-05
Date
May 1988
Publisher
Language
Abstract
We compare the performance of three heuristic algorithms [3,6,13] for the minimization of
sum-of-products expressions realized by the newly
developed multiplevalued 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.
Type
Article
Description
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.
Proceedings of the 18th International Symposium on Multiple-Valued Logic, May 1988, pp. 226-236
Proceedings of the 18th International Symposium on Multiple-Valued Logic, May 1988, pp. 226-236
Series/Report No
Department
Department of Electrical and Computer Engineering
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Proceedings of the 18th International Symposium on Multiple-Valued Logic, May 1988, pp. 226-236