<p>Timing research in high performance VLSI systems has advanced at a steady pace over the last few years, while tools, especially theoretical mechanisms, lag behind. Much present timing research relies heavily on timing diagrams, which, although intuitive, are inadequate for analysis of large desig
Timed Boolean Functions: A Unified Formalism for Exact Timing Analysis
β Scribed by Lam W.K., Brayton R.K.
- Publisher
- Springer
- Year
- 1994
- Tongue
- English
- Leaves
- 297
- Series
- The Springer International Series in Engineering and Computer Science
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
Timing research in high performance VLSI systems has advanced at a steady pace over the last few years. Tools, however, especially theoretical mechanisms, lag behind. Much of the present timing research relies heavily on timing diagrams, which although intuitive, are inadequate for analysis of large designs with many parameters. Further, timing diagrams offer only approximations, not exact solutions to many timing problems and provide little insight in the cases where temporal properties of a design interact intricately with the design's logical functionalities. Timed Boolean Functions presents a methodology for timing research which facilitates analysis and design of circuits and systems in a unified temporal and logical domain. The goal of the book is to present the central idea of representing logical and timing information in a common structure, TBFs, and to present a canonical form suitable for efficient manipulation. This methodology is then applied to practical applications to provide intuition and insight into the subject so that these general methods can be adapted to specific engineering problems and also to further the research necessary to enhance the understanding of the field. Timed Boolean Functions is written for professionals involved in timing research and digital designers who want to enhance their understanding of the timing aspects of high speed circuits. The prerequisites are a common background in logic design, computer algorithms, combinatorial optimization and a certain degree of mathematical sophistication.
β¦ Subjects
ΠΠ°ΡΠ΅ΠΌΠ°ΡΠΈΠΊΠ°;ΠΠΈΡΠΊΡΠ΅ΡΠ½Π°Ρ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΠΊΠ°;
π SIMILAR VOLUMES
Boolean functions are perhaps the most basic objects of study in theoretical computer science. They also arise in other areas of mathematics, including combinatorics, statistical physics, and mathematical social choice. The field of analysis of Boolean functions seeks to understand them via their Fo
<p><p></p><p>This book presents a novel mathematical formalism, based on the tetrad formulation of differential geometry, for describing cosmological observables exactly and conveniently. It covers all the standard observables, i.e. distances, weak lensing, number counts and cosmic microwave backgro