Abstract
In this paper we consider the problem of decomposition of information and logic systems and its implementation using decision and truth tables, respectively. The main reason behind using the described method is its economic representation of knowledge in information systems, knowledge base, data base and in all the other applications of information storing systems. Another potentially very promising area of application of decomposition is logic systems designing. This is because the novel hardware building blocks impose limitations on the size of circuits that can be implemented with them. The decomposition method has been implemented as a set of tools including reduction of attributes as well as functional decomposition. The experimental results show that the method is very efficient.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Filo, J.C. Yang, F. Mailhot, and G.D. Micheli, Technology Mapping for a Two-Output RAM-based Field-Programmable Gate Array. Proc. European Conference on Design Automation, pp. 534–538, 1991.
R. Francis, J. Rose, Z. Vranesic, Chortle-crf: Fast Technology Mapping Look-up Table-Based FPGAs. Proc.28-th ACM/IEEE Design Automation Conf., pp. 227–233, 1991.
T. Luba, R. Lasocki, Decomposition of multiple-valued boolean functions. Journal of Applied Mathematics and Computer Science, vol. 4, No.1., WSI Zielona Góra, 1994.
T. Luba, J. Rybnik, Algorithm of Elimination of Attributes and Arguments Based on Unate Complement Concept. Bull. Polish Acad. Sci., vol. 40, No. 3. pp. 313–322, 1992.
T. Luba, J. Rybnik, Rough Sets and Some Aspects in Logic Synthesis. In Intelligent Decision Support — Handbook of Application and Advances of the Rough Sets Theory, R. Slowinski (ed), Kluwer Academic Publishers, 1992.
T. Luba, H. Selvaraj, A. Krasniewski, A New Approach to FPGA-based Logic Synthesis. Workshop on Design Methodologies for Microelectronics and Signal Processing, Gliwice — Cracow, pp. 135–142, 1993.
T. Sasao, Logic Synthesis and Optimization. Kluwer Academic Publishers, 1993.
P. Sicard, M. Crastes, K. Sakouti, G. Saucier, Automatic synthesis of boolean functions on Xilinx and Actel Programmable devices. Proc. Euro ASIC ‘81. pp. 142–145, 1991.
W. Wan, M.A. Perkowski, A New Approach to the Decomposition of Incompletely Specified Multi-Output Function Based on Graph Coloring and Local Transformations and Its Application to FPGA Mapping. Proc. European Design Automation Conf., pp. 230–235, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 British Computer Society
About this paper
Cite this paper
Łuba, T., Lasocki, R., Rybnik, J. (1994). An Implementation of Decomposition Algorithm and its Application in Information Systems Analysis and Logic Synthesis. In: Ziarko, W.P. (eds) Rough Sets, Fuzzy Sets and Knowledge Discovery. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3238-7_54
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3238-7_54
Publisher Name: Springer, London
Print ISBN: 978-3-540-19885-7
Online ISBN: 978-1-4471-3238-7
eBook Packages: Springer Book Archive