Abstract
Of course decomposition based methods cannot compute implementations for designs of arbitrary complexity. The size of the examples to be processed by decomposition is limited by the need to represent the corresponding Boolean functions in a form which is appropriate for the computations of a decomposition tool. Though the use of robdds instead of function tables and decomposition matrices has led to a breakthrough concerning the sizes of functions which can be processed by decomposition, it is clear that there are limits for the use of robdds. At the least, when it is not possible to represent a Boolean function by an robdd using the memory resources available, the current decomposition methods cannot be applied.
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). Large Circuits. In: Functional Decomposition with Applications to FPGA Synthesis. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3393-8_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3393-8_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4929-5
Online ISBN: 978-1-4757-3393-8
eBook Packages: Springer Book Archive