%0 Journal Article
%T COMPACT XOR-BI-DECOMPOSITION FOR LATTICES OF BOOLEAN FUNCTIONS
%A Bernd Steinbach
%A Christian Posthoff
%J -
%D 2018
%X Bi-Decomposition is a powerful approach for the synthesis of multi-level combinational circuits because it utilizes the properties of the given functions to £¿nd small circuits, with low power consumption and low delay. Compact bi-decompositions restrict the variables in the support of the decomposition functions as much as possible. Methods to £¿nd compact AND-, OR-, or XOR-bi-decompositions for a given completely speci£¿ed function are well known. Lattices of Boolean Functions signi£¿cantly increase the possibilities to synthesize a minimal circuit. However, so far only methods to £¿nd compact AND- or OR-bidecompositions for lattices of Boolean functions are known. This gap, i.e., a method to £¿nd a compact XOR-bi-decomposition for a lattice of Boolean functions, has been closed by the approach suggested in this paper
%K synthesis
%K combinational circuit
%K lattice of Boolean functions
%K XOR-bi-decomposition
%K Boolean Differential Calculus
%K derivative operations.
%U http://casopisi.junis.ni.ac.rs/index.php/FUElectEnerg/article/view/3307