Totally Undecomposable Functions: Applications to Efficient Multiple-Valued Decompositions

Authors:
Tsutomu Sasao
Affiliations:
-
Venue:
ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic
Year:
1999

Citing 0
Cited 2

Three parameters to find functional decompositions

ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
A BDD-based fast heuristic algorithm for disjoint decomposition

ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

A function \math\mathis k-decomposable if \mathcan be represented as \math\mathwhere \mathis a bipartition of input variables. This paper introduces the notion of totally k-undecomposable functions. By using this concept, we can drastically reduce the search space to find k-decompositions. A systematic method to find the bipartitions of input variables that will not produce any k-decompositions is presented. By combining it to the conventional decomposition methods, we can build an efficient functional decomposition system. This method is promising to design LUT-based FPGAs.