Abstract
As integrated circuits are growing in complexity, circuit simulation tools are being pushed towards greater flexibility and efficiency. In the long run, bounding algorithms promise to lead to sophisticated simulators that extract information about digital MOS circuit behavior with much greater efficiency than is currently possible. This book establishes a theoretical framework for generating rigorous bounding algorithms that perform well on a large portion of a typical digital MOS circuit model, i.e., the portion containing standard digital cells such as restoring logic gates. These bounding algorithms build on Waveform Relaxation, an established exact technique, and can also build on successful approximate techniques such as piecewise-linear simulation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer Science+Business Media New York
About this chapter
Cite this chapter
Zukowski, C.A. (1986). Conclusion. In: The Bounding Approach to VLSI Circuit Simulation. The Springer International Series in Engineering and Computer Science, vol 17. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-9891-2_7
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9891-2_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-9893-6
Online ISBN: 978-1-4684-9891-2
eBook Packages: Springer Book Archive