Modular Decomposition of Combinatorial Multiple-Values Circuits
IEEE Transactions on Computers
Logic synthesis for programmable gate arrays
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
BDD based decomposition of logic functions with application to FPGA synthesis
DAC '93 Proceedings of the 30th international Design Automation Conference
Lambda set selection in Roth-Karp decomposition for LUT-based FPGA technology mapping
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Automated database schema design using mined data dependencies
Journal of the American Society for Information Science - Special issue: knowledge discovery and data mining
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
Functional Decomposition with Application to FPGA Synthesis
Functional Decomposition with Application to FPGA Synthesis
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Discrete Structures for Computer Science and Engineering
Introduction to Discrete Structures for Computer Science and Engineering
Machine Learning by Function Decomposition
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Bi-Decomposition of Function Sets in Multiple-Valued Logic for Circuit Design and Data Mining
Artificial Intelligence Review
Effective and efficient FPGA synthesis through general functional decomposition
Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Reconfigurable systems
Theory of Relational Databases
Theory of Relational Databases
Automated Synthesis of Combinational Logic Using Theorem-Proving Techniques
IEEE Transactions on Computers
Multiple-Valued Logic its Status and its Future
IEEE Transactions on Computers
Database Systems: The Complete Book
Database Systems: The Complete Book
Minimization over Boolean trees
IBM Journal of Research and Development
Minimization over Boolean graphs
IBM Journal of Research and Development
A computer program for the synthesis of combinational switching circuits
FOCS '61 Proceedings of the 2nd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1961)
OBDD-based function decomposition: algorithms and implementation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An exact algorithm for the maximum clique problem
Operations Research Letters
| Hi-index | 0.00 |
Functional decomposition of Boolean functions has a profound influence on all quality aspects of cost-effectively implementing modern digital systems and data-mining. The relational databases are multivalued tables, which include any truth tables of logic functions as special cases. In this article, we propose a relational database approach to the decomposition of logic circuits. The relational algebra consists of a set of well-defined algebraic operations that can be performed on multivalued tables. Our approach shows that the functional decomposition of logic circuits is similar to the normalization of relational databases; they are governed by the same concepts of functional dependency (FD) and multivalued dependency (MVD). The completeness of relational algebra demonstrated by our approach to functional decomposition reveals that the relational database is a fundamental computation model, the same as the Boolean logic circuit.