Circuit minimization for Boolean functions

Known as: Circuit minimization, Logic circuit minimization, Boolean minimization 
In Boolean algebra, circuit minimization is the problem of obtaining the smallest logic circuit (Boolean formula) that represents a given Boolean… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1958-2017
05101519582017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
We investigate restructuring techniques based on decomposition/factorization, with the objective to move critical signals toward… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
2004
2004
The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2003
2003
In this paper a Boolean minimization algorithm is considered and implemented as an applet in Java. The application is based on… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2001
2001
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous… (More)
  • figure 1
  • table 1
  • table 2
  • table 4
  • table 3
Is this relevant?
2001
2001
The paper presents a new method of Boolean function minimization based on an original approach to implicant generation. The… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We study the complexity of the following circuit minimization problem: given the t ruth table of a Boolean function f and a… (More)
Is this relevant?
1995
1995
In this paper we present a complete Boolean method for reducing the power consumption in two-level combinational circuits. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
Highly Cited
1984
Highly Cited
1984
A differential CMOS Logic family that is well suited to automated logic minimization and placement and routing techniques, yet… (More)
  • figure I
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1974
Highly Cited
1974
MINI is a heuristic logic minimization technique for many-variable problems. It accepts as input a Boolean logic specification… (More)
Is this relevant?
1964
1964
An approach to the problem of multilevel Boolean minimization is described. The conventional prime implicant is generalized to… (More)
  • table II
Is this relevant?