FC-Min: a fast multi-output Boolean minimizer

Fišer, Petr; Hlavicka, J.; Kubátová, Hana

doi:10.1109/dsd.2003.1231982

Cited by 11 publications

(8 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After that, the implicants should be yet expanded in order to reduce the total number of literals. Description of this process exceeds the scope of this paper, for more information see [11].…”

Section: Principles Of Fc-minmentioning

confidence: 99%

“…This process will be denoted as an Implicant Generation phase. For more detailed description see [11].…”

Section: Incremental Implicant Generationmentioning

confidence: 99%

“…In a trivial case, solution of a problem with p terms could consist of p implicants created just by an expansion of the input terms, while the coverage masks of the terms would be equal to the output vectors of the respective source terms. Here the Find Cover phase is, de facto, omitted, the minimization consists just of the input expansion phase (see [11]). …”

Section: Influence Of Df On the Solutionmentioning

confidence: 99%

“…Our Boolean minimizer FC-Min [11] generally solved this problem. Here the implicants are being generated in a completely different way: first the cover of the on-set is found (in the Find Coverage phase) and after that the implicants satisfying this cover are computed from the input terms.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Boolean minimizer FC-min: coverage finding process

Fišer

Kubátová

2004

Euromicro Symposium on Digital System Design, 2004. DSD 2004.

Self Cite

View full text Add to dashboard Cite

This paper describes principles of a novel two-level multi-output Boolean minimizer FC-Min, namely its FindCoverage phase. The problem of Boolean minimization is approached in a reverse way than common minimizers do. First, the cover of the on-set is found, and after that the appropriate implicants are being constructed to satisfy this cover. Thus, only the necessary group implicants are being generated, which makes FC-Min an extremely fast and efficient minimizer for functions with many output variables. An essential phase of the algorithm is the Find Coverage procedure. This phase determines the number of terms in the final solution, which has to be reduced to minimum. It solves an NP-hard problem, thus some heuristic has to be applied. We propose our heuristic method to solve this problem and study the influence of parameters on the final solution quality and runtime.

show abstract

Section: Principles Of Fc-minmentioning

confidence: 99%

“…This process will be denoted as an Implicant Generation phase. For more detailed description see [11].…”

Section: Incremental Implicant Generationmentioning

confidence: 99%

Section: Influence Of Df On the Solutionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Boolean minimizer FC-min: coverage finding process

Fišer

Kubátová

2004

Euromicro Symposium on Digital System Design, 2004. DSD 2004.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The requirement of efficient multiple input logic synthesis in different fields like automatic control system design, many areas of FPGA design flow [2][3][4], VLSI synthesis [5], the design of BIST, feature reduction [6] and biological logic circuits designing [7]. It is possible to design the same functional combinational circuit with various design styles.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Technique For Switching Functions Simplification

Roy

2017

ijoaem

View full text Add to dashboard Cite

In this paper, we propose a new approach for switching function simplification using octal coded minterms. This novel method of two-level minimization techniques effectively reduces the number of steps in comparison with other existing methods. A chart for octal based minimization for manual minimization process is also proposed herein. Proposed minimization method factorized minterms in a group of three input variables which are represented in octal code. These groups of minterms further paired with adjacent minterms. For easy detection, an octal chart also proposed here. The proposed method effectively reduces the complexity of multiple input minimization process. The results, which are verified by comparison with available experimental data, indicated that the minimal product of some was achieved with minimal effort.

show abstract

Fuzzy modelling through logic optimization

Gobi

Pedrycz

2007

International Journal of Approximate Reasoning

View full text Add to dashboard Cite

FC-Min: a fast multi-output Boolean minimizer

Cited by 11 publications

References 14 publications

Boolean minimizer FC-min: coverage finding process

Boolean minimizer FC-min: coverage finding process

An Efficient Technique For Switching Functions Simplification

Fuzzy modelling through logic optimization

Contact Info

Product

Resources

About