Abstract
This paper presents an efficient functional decomposition method based on the indexed partition calculus. The computational efficiency of indexed partition manipulation procedures allows performing multilevel logic synthesis for multi-output, not fully specified Boolean functions of large number of input variables. The presented results prove that the proposed approach can generate results of high quality.
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
References
J.A. Brzozowski and T. Łuba. Decomposition of boolean functions specified by cubes. Journal of Multiple-Valued Logic and Soft Computing, 9:377–417, 2003.
L. Jóźwiak. Information relationships and measures: an analysis apparatus for efficient information system synthesis. In EUROMICRO’97. New Frontiers of Information Technology., Proceedings of the 23rd EUROMICRO Conference, pages 13–23, September 1997.
A. Mishchenko, R. Brayton, and S. Chatterjee. Boolean factoring and decomposition of logic networks. In Computer-Aided Design, 2008. ICCAD 2008. IEEE/ACM International Conference on, pages 38–44, November 2008.
M. Rawski. Decomposition of boolean function sets. Electronics and Telecommunications Quarterly, 53(3), 2007.
M. Rawski. Application of indexed partition calculus in logic synthesis of boolean functions for FPGAs. International Journal of Electronics and Telecommunications, 57(2), 2011.
M. Rawski. Heuristic algorithm of bound set selection in functional decomposition for heterogeneous FPGAs. In Systems Engineering (ICSEng), 2011 21st International Conference on, pages 465–466, 2011.
M. Rawski, T. Łuba, Z. Jachna, and P. Tomaszewicz. The influence of functional decomposition on modern digital design process. Design of Embedded Control Systems, pages 193–203, 2005.
T. Sasao, Y. Iguchi, and M. Matsuura. Comparison of decision diagrams for multiple-output logic functions. In International Workshop on Logic and Synthesis, pages 4–7, 2002.
T. Sasao and M. Matsuura. BDD representation for incompletely specified multiple-output logic functions and its applications to functional decomposition. In IN PROC. DESIGN AUTOMATION CONF, pages 373–378, 2005.
H. Selvaraj, P. Sapiecha, M. Rawski, and T. Łuba. Functional decomposition - the value and implication for both neural networks and digital designing. International Journal of Computational Intelligence and Applications, 6(1):123–138, 2006.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Rawski, M., Tomaszewicz, P., Szotkowski, P. (2015). Efficient Functional Decomposition Algorithm Based on Indexed Partition Calculus. In: Selvaraj, H., Zydek, D., Chmaj, G. (eds) Progress in Systems Engineering. Advances in Intelligent Systems and Computing, vol 366. Springer, Cham. https://doi.org/10.1007/978-3-319-08422-0_117
Download citation
DOI: https://doi.org/10.1007/978-3-319-08422-0_117
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08421-3
Online ISBN: 978-3-319-08422-0
eBook Packages: EngineeringEngineering (R0)