Name
Title | ||
|---|---|---|
Bottom-Up Disjoint-Support Decomposition Based On Cofactor And Boolean Difference Analysis |
Abstract | ||
|---|---|---|
This paper presents a new approach for Boolean decomposition based on the Boolean difference and cofactor analysis. Two simple tests provide sufficient and necessary conditions to identify AND and exclusive-OR (XOR) decompositions. The proposed method can decompose an n-input function in O(n . log n) cofactor and O(n) equivalence test operations. Recently, 2-to-1 multiplexers (MUX) have also been used to perform such decomposition. However, MUX with more inputs has been neglected. We provide sufficient and necessary conditions to obtain MUX decompositions of functions with an arbitrary number of inputs. |
Year | Venue | Keywords |
|---|---|---|
2015 | 2015 33RD IEEE INTERNATIONAL CONFERENCE ON COMPUTER DESIGN (ICCD) | logic synthesis, functional decomposition, disjoint support decomposition, digital circuit, EDA |
Field | DocType | Citations |
Boolean function,Discrete mathematics,Boolean circuit,Disjoint sets,Computer science,Parallel computing,Algorithm,Combinational logic,Boolean algebra,And-inverter graph,Boolean expression,Circuit minimization for Boolean functions | Conference | 0 |
PageRank | References | Authors |
0.34 | 8 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vinicius Callegaro | 1 | 31 | 6.40 |
| Felipe S. Marranghello | 2 | 21 | 6.50 |
| Mayler G. A. Martins | 3 | 88 | 10.08 |
| Renato P. Ribas | 4 | 204 | 33.52 |
| André Inácio Reis | 5 | 134 | 21.33 |