Над 4 милиона заглавия на английски и други езици! Открийте новата си история още днес! Безплатна доставка за поръчки над 69.99€

Виж статуса на поръчката

Свържете се с нас

Timed Boolean Functions

Name: Timed Boolean Functions
Brand: Springer-Verlag New York Inc.
SKU: 9781461361565
Price: 116.18 EUR
Availability: InStock

A Unified Formalism for Exact Timing Analysis

Автор: William K.C. Lam, Robert K. Brayton

Език:

Корици: С меки корици

Издател: Springer-Verlag New York Inc.

Наличност: Външен склад в ограничено количество

Изпращаме след 13-18 дни

116.18 € 227.23 лв

Timing research in high performance VLSI systems has advanced at a steady pace over the last few yea...

Информация за книгата

Автор

William K.C. Lam, Robert K. Brayton

Език

Английски език

Корици

Книга - С меки корици

Издадена

2012

страници

273

EAN

9781461361565

ISBN

1461361567

Enbook ID

06796565

Издател

Springer-Verlag New York Inc.

Теглоt

462

Размери

155 x 235 x 17

Пълно описание

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 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. This book presents a methodology for timing research which facilitates analy sis and design of circuits and systems in a unified temporal and logical domain. In the first part, we introduce an algebraic representation formalism, Timed Boolean Functions (TBF's), which integrates both logical and timing informa tion of digital circuits and systems into a single formalism. We also give a canonical form, TBF BDD's, for them, which can be used for efficient ma nipulation. In the second part, we apply Timed Boolean Functions to three problems in timing research, for which exact solutions are obtained for the first time: 1. computing the exact delays of combinational circuits and the minimum cycle times of finite state machines, 2. analysis and synthesis of wavepipelining circuits, a high speed architecture for which precise timing relations between signals are essential for correct operations, 3. verification of circuit and system performance and coverage of delay faults by testing.