التفاصيل البيبلوغرافية
| العنوان: |
A Relational Approach to Functional Decomposition of Logic Circuits. |
| المؤلفون: |
Tony T. Lee1 ttlee@ie.cuhk.edu.hk, Tong Ye2 yetong@sjtu.edu.cn |
| المصدر: |
ACM Transactions on Database Systems. May2011, Vol. 36 Issue 2, p13-13:30. 30p. 11 Diagrams, 4 Charts. |
| مصطلحات موضوعية: |
*DATA mining, *SQL, MATHEMATICAL decomposition, LOGIC circuits, DIGITAL electronics, COMPUTER circuits |
| مستخلص: |
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. [ABSTRACT FROM AUTHOR] |
|
Copyright of ACM Transactions on Database Systems is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Business Source Index |
