Abstract
One of the crucial problems multi-level logic synthesis techniques for multi-output boolean functions f = (f1,…,f m ) : {0,1}n → {0,1}m have to deal with is finding sublogic which can be shared by different outputs, i.e., finding boolean functions α = (α1,…,α h ) : {0,1}p → {0,1}h which can be used as common sublogic of good realizations of f1,…,f m .
Chapter PDF
Similar content being viewed by others
References
R.L. Ashenhurst. The decomposition of switching functions. In Proceedings on an International Symposium on the Theory of Switching held at Comp. Lab. of Harvard University, pages 74–116, 1959.
R.K. Brayton, G.D. Hachtel, and A. L. Sangiovanni-Vincentelli. Multilevel logic synthesis. Proceedings of the IEEE, 78 (2): 264–300, February 1990.
R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. on Computers, C-35(8): 677–691, August 1986.
H.A. Curtis. A generalized tree circuit. J. Assoc. Comput. Mach., 8: 484–496, 1961.
T. Hwang, R.M. Owens, and M.J. Irwin. Efficient computing communication complexity for multilevel logic synthesis. IEEE Trans. on CAD CAD-11(5):545–554
May 1992. R.M. Karp. Functional decomposition and switching circuit design. Journal of Society of Industrial Applied Mathematics, 11 (2): 291–335, June 1963.
Y. Lai, M. Pedram, and S. Vrudhula. BDD based decomposition of logic functions with application to FPGA synthesis. In IEEE/ACM Design Automation Conference DAC98, pages 642–647, 1993.
Y. Lai, K. Pan, and M. Pedram. FPGA Synthesis using Function Decomposition. In Proceedings of ICCD94, pages 30–35, 1994.
P. Molitor, C. Scholl. Communication based multilevel synthesis for multioutput boolean functions. In Proceedings of the 4th Great Lakes Symposium on VLSI, Notre Dame, Indiana, March 1994.
U. Schlichtmann. Boolean Matching and Disjoint Decomposition for FPGA Technology Mapping. In Proceedings of the IFIP Workshop on Logic and Architecture Synthesis, pages 83–102, 1993.
E. Sentovich et al. SIS: a system for sequential circuit synthesis. Department of EE and CS, UC Berkeley, May 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Scholl, C., Molitor, P. (1995). Efficient ROBDD based computation of common decomposition functions of multi-output boolean functions. In: Saucier, G., Mignotte, A. (eds) Logic and Architecture Synthesis. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34920-6_5
Download citation
DOI: https://doi.org/10.1007/978-0-387-34920-6_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2923-7
Online ISBN: 978-0-387-34920-6
eBook Packages: Springer Book Archive