Measuring Area-Complexity Using Boolean Difference
Citations
10 citations
References
272,030 citations
"Measuring Area-Complexity Using Boo..." refers methods in this paper
...We use R Statistical Computing Tool [13], to perform linear regression....
[...]
774 citations
"Measuring Area-Complexity Using Boo..." refers background in this paper
...The area-complexity of a circuit can be measured in terms of the number of inputs or literals or gates, etc. Characterizing logic functions and estimation of areacomplexity dates back to 1949 when Shannon [1] measured the area-complexity as the amount of switching activity in the circuit....
[...]
...We exploit this relationship and propose a metric for estimating the number of logic gates required by a function....
[...]
201 citations
"Measuring Area-Complexity Using Boo..." refers background in this paper
...For a Boolean function F (x1, x2, ..., xn), the cofactor of F (Fa) w.r.to a literal a = xi or a = x̄i is defined as Fxi(x1, ..., xi, ..., xn) = F (x1, ..., 1, ..., xn) Fx̄i(x1, ..., xi, ..., xn) = F (x1, ..., 0, ..., xn) Fxi and Fx̄i are called the positive cofactor and the negative cofactor of F…...
[...]
...1 and 2 are called as the 1-fold and the 2-fold Boolean derivatives of F respectively....
[...]
140 citations
"Measuring Area-Complexity Using Boo..." refers methods in this paper
...With rising popularity of BDDs in the 1990’s, many metrics used the structural parameters of the BDDs, like the number of nodes, as an area-complexity measure [7], [8]....
[...]
119 citations
"Measuring Area-Complexity Using Boo..." refers background in this paper
...This can lead to overprediction of the number of gates as frequent application of logic synthesis algorithms often reduces the gate-count....
[...]