Functional decomposition of MVL functions using multi-valued decision diagrams
Authors:
- C. FilesCFC. Files
- R. DrechslerRDR. Drechsler
- M.A. PerkowskiMPM.A. Perkowski
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
In this paper, the minimization of incompletely speci- fied multi-valued functions using functional decomposition is discussed. From the aspect of machine learning, learning samples can be implemented as minterms in multi-valued logic. The representation, can then be decomposed into smaller blocks, resulting in a reduced problem complexity. This gives induced descriptions through structuring, or fea- ture extraction, of a learning problem. Our approach to the decomposition is based on expressing a multi-valued func- tion (learning problem) in terms of a Multi-valued Decision Diagram that allows the use of Don't Cares. The inclusion of Don't Cares is the emphasis for this paper since multi- valued benchmarks are characterized as having many Don't Cares.Keywords
This publication has 9 references indexed in Scilit:
- Algorithms for discrete function manipulation2002
- Decomposition of multiple-valued relations2002
- Decomposition of multiple-valued functions2002
- Efficient ROBDD based computation of common decomposition functions of multi-output boolean functions1995
- BDD based decomposition of logic functions with application to FPGA synthesis1993
- MIS-MV: optimization of multi-level logic with multiple-values inputs1990
- Complexity in Information Theory1988
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Minimization Over Boolean GraphsIBM Journal of Research and Development, 1962