作者: T. Sasao
DOI: 10.1109/ISMVL.1999.779696
关键词: Mathematics 、 Discrete mathematics 、 Symmetric function 、 Function (mathematics) 、 Functional decomposition 、 Lookup table 、 Space (mathematics)
摘要: A function f:P/sup n//spl rarr/P, P={0, 1, ..., p-1} is k-decomposable iff f can be represented as f(X/sub 1/, X/sub 2/)=g(h/sub 1/(X/sub 1/), h/sub 2/(X/sub k/(X/sub 2/), where (X/sub 2/) a bipartition of input variables. This paper introduces the notion totally k-undecomposable functions. By using this concept, we drastically reduce search space to find k-decompositions. systematic method bipartitions variables that will not produce any k-decompositions presented. combining it conventional decomposition methods, build an efficient functional system. promising design LUT-based FPGAs.