Proceedings Article10.1109/ISMVL.1990.122611
A neighborhood decoupling algorithm for truncated sum minimization
Chyan Yang,Y.-M. Wang +1 more
- 23 May 1990
- pp 153-160
22
TL;DR: A heuristic, called the neighborhood decoupling (ND) algorithm, is described, which makes more efficient use of minterms truncated to the highest logic value.
read more
Abstract: A heuristic, called the neighborhood decoupling (ND) algorithm, is described. It first selects a minterm and then selects an implicant, a two-step process employed in previous heuristics. The approach taken closely resembles the G.W. Dueck and D.M. Miller (1987) heuristic; however, it makes more efficient use of minterms truncated to the highest logic value. The authors present the algorithm, discuss its implementation, show that it performs consistently better than others, and explain the reason for its improved performance. >
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
HAMLET-an expression compiler/optimizer for the implementation of heuristics to minimize multiple-valued programmable logic arrays
J.M. Yurchak,Jon T. Butler +1 more
- 23 May 1990
TL;DR: HAMLET is a CAD tool written in C that translates a user specification of a multiple-valued expression into a layout of amultiple-valued programmable logic array (MVL-PLA) which realizes that expression, and can apply search strategies based on these heuristics.
39
Multiple-valued programmable logic array minimization by simulated annealing
Gerhard W. Dueck,R.C. Earle,P.P. Tirumalai,Jon T. Butler +3 more
- 27 May 1992
TL;DR: A solution to the minimization problem for multivalued programmable logic arrays (PLAs) that uses simulated annealing that manipulates product terms directly, breaking them up and joining them in different ways while reducing the total number of product terms.
Weighted and Ordered Direct Cover Algorithms for Minimization of MVL Functions
Mostafa Abd-El-Barr,Bambang A. B. Sarif +1 more
- 13 May 2007
TL;DR: It is shown that the proposed approaches outperform other existing direct cover based techniques in terms of the average number of product terms required to realize a given MVL function.
12
Synthesis of MVL Functions - Part II: The Ant Colony Optimization Approach
Mostafa Abd-El-Barr,Bambang A. B. Sarif +1 more
- 01 Dec 2006
TL;DR: An ant colony optimization (ACO) based algorithm for synthesis of Multiple-Valued Logic (MVL) functions is proposed and outperforms other approaches in terms of the average number of product terms required to realize a given MVL function.
Experiences of parallel processing with direct cover algorithms for multiple-valued logic minimization
Chyan Yang,O. Oral +1 more
- 27 May 1992
TL;DR: The implementation of the direct cover algorithm, a heuristic, on a real parallel computer system, Intel iPSC/2, is reported and another parallel implementation of ND, multibranch ND, outperforms PND in both optimality and speed.
10
References
•Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
- 01 Jan 1974
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
10.6K
Representation of Multivalued Functions Using the Direct Cover Method
TL;DR: The direct cover method is shown to require much less computation time than prime implicant based methods, thus making it practical for functions with a large number of input variables and/or as the radix of implementation increases.
57
Heuristic Minimization of MVL Functions: A Direct Cover Approach
TL;DR: A heuristic method to obtain near-minimal covers of p-valued switching functions is introduced and transform tools useful in the processing of MVL functions are described, including p-adic shifting, weighting, and implicant detecting transformations.
55
A New Technique for the Fast Minimization of Switching Functions
TL;DR: In this article, the authors present a new minimization procedure that allows this process to be implemented with reduced computational effort, which is applicable to both manual and computer-programmed minimization.
46