Abstract
The efficiency of good realizations of Boolean functions is often based on the fact that subcircuits are ‘used more than once’. Identifying those subcircuits which several parts of the overall circuit may take advantage of, is a fundamental task in multi—level logic synthesis (see Figure 4.1).
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Scholl, C. (2001). Functional Decomposition for Completely Specified Multi-Output Functions. In: Functional Decomposition with Applications to FPGA Synthesis. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3393-8_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3393-8_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4929-5
Online ISBN: 978-1-4757-3393-8
eBook Packages: Springer Book Archive