Asynchronous Circuits (Monographs in Computer Science) de Janusz A. Brzozowski

Asynchronous Circuits: Monographs in Computer Science

Janusz A. Brzozowski

C.E. Molnar

Carl-Johan H. Seger

Although asynchronous circuits date back to the early 1950s most of the digital circuits in use today are synchronous because, traditionally, asynchronous circuits have been viewed as difficult to understand and design. In recent years, however, there has been a great surge of interest in asynchronous circuits, largely through the development of new asynchronous design methodologies.
This book provides a comprehensive theory of asynchronous circuits, including modelling, analysis, simulation, specification, verification, and an introduction to their design. It is based on courses given to graduate students and will be suitable for computer scientists and engineers involved in the research and development of asynchronous designs.

Citește tot Restrânge

Toate formatele și edițiile

	Preț	Express
Paperback (1)	934^.49 lei 6-8 săpt.
Springer – 11 noi 2011	934^.49 lei 6-8 săpt.
Hardback (1)	940^.68 lei 6-8 săpt.
Springer – 24 feb 1995	940^.68 lei 6-8 săpt.

Din seria Monographs in Computer Science

20%

Preț: 1209^.56 lei
20%

Preț: 503^.31 lei
20%

Preț: 1263^.60 lei
20%

Preț: 327^.63 lei
20%

Preț: 323^.10 lei
15%

Preț: 636^.05 lei
20%

Preț: 351^.49 lei
20%

Preț: 333^.78 lei
20%

Preț: 642^.20 lei
20%

Preț: 323^.93 lei
20%

Preț: 976^.98 lei
20%

Preț: 975^.51 lei
20%

Preț: 1603^.37 lei
20%

Preț: 644^.99 lei
20%

Preț: 639^.14 lei
20%

Preț: 322^.59 lei
20%

Preț: 630^.36 lei
20%

Preț: 328^.79 lei
18%

Preț: 725^.31 lei
20%

Preț: 631^.37 lei
20%

Preț: 631^.20 lei
20%

Preț: 339^.80 lei
20%

Preț: 699^.29 lei
20%

Preț: 984^.28 lei
20%

Preț: 650^.32 lei
20% $A Logical Approach to Discrete Math$

Preț: 337^.87 lei
20%

Preț: 633^.94 lei
15%

Preț: 496^.83 lei
20%

Preț: 629^.90 lei
Preț: 390^.15 lei
20%

Preț: 582^.70 lei
20%

Preț: 323^.93 lei
Preț: 376^.93 lei
20%

Preț: 343^.55 lei
20%

Preț: 818^.36 lei
20%

Preț: 976^.65 lei
15%

Preț: 569^.14 lei
20%

Preț: 332^.19 lei
20%

Preț: 971^.48 lei
20%

Preț: 979^.72 lei
20%

Preț: 1271^.54 lei
20%

Preț: 1428^.40 lei

Cuprins

1 Introductory Examples.- 1.1 Logic Gates.- 1.2 Performance Estimation.- 1.3 RS Flip-Flop.- 1.4 Dynamic CMOS Logic.- 1.5 Divide-by-2 Counter.- 1.6 Summary.- 2 Mathematical Background.- 2.1 Sets and Relations.- 2.2 Boolean Algebra.- 2.3 Ternary Algebra.- 2.4 Directed Graphs.- 3 Delay Models.- 3.1 Environment Modes.- 3.2 Gates with Delays.- 3.3 Ideal Delays.- 3.4 Inertial Delays.- 4 Gate Circuits.- 4.1 Properties of Gates.- 4.2 Classes of Gate Circuits.- 4.3 The Circuit Graph.- 4.4 Network Models.- 4.5 Models of More Complex Gates.- 5 CMOS Transistor Circuits.- 5.1 CMOS Cells.- 5.2 Combinational CMOS Circuits.- 5.3 General CMOS Circuits.- 5.4 Node Excitation Functions.- 5.5 Path Strength Models.- 5.6 Capacitance Effects.- 5.7 Network Model of CMOS Circuits.- 6 Up-Bounded-Delay Race Models.- 6.1 The General Multiple-Winner Model.- 6.2 GMW Analysis and UIN Delays.- 6.3 The Outcome in GMW Analysis.- 6.4 Stable States and Feedback-State Networks.- 6.5 GMW Analysis and Network Models.- 6.6 The Extended GMW Model.- 6.7 Single-Winner Race Models.- 6.8 Up-Bounded Ideal Delays.- 6.9 Proofs.- 7 Ternary Simulation.- 7.1 Introductory Examples.- 7.2 Algorithm A.- 7.3 Algorithm B.- 7.4 Feedback-Delay Models.- 7.5 Hazards.- 7.6 Ternary Simulation and the GSW Model.- 7.7 Ternary Simulation and the XMW Model.- 7.8 Proofs of Main Results.- 8 Bi-Bounded Delay Models.- 8.1 Discrete Binary Models.- 8.2 Continuous Binary Model.- 8.3 Algorithms for Continuous Binary Analysis.- 8.4 Continuous Ternary Model.- 8.5 Discrete Ternary Model.- 9 Complexity of Race Analysis.- 9.1 Stable-State Reachability.- 9.2 Limited Reachability.- 10 Regular Languages and Finite Automata.- 10.1 Regular Languages.- 10.2 Regular Expressions.- 10.3 Quotient Equations.- 10.4 Finite Automata.- 10.5 Equivalence and Reduction of Automata.- 10.6 Nondeterministic Automata.- 10.7 Expression Automata.- 11 Behaviors and Realizations.- 11.1 Motivation.- 11.2 Behaviors.- 11.3 Projections of Implementations to Specifications.- 11.4 Relevant Words.- 11.5 Proper Behaviors.- 11.6 Realization.- 11.7 Behavior Schemas.- 11.8 Concluding Remarks.- 12 Types of Behaviors.- 12.1 Introductory Examples.- 12.2 Fundamental-Mode Specifications.- 12.3 Fundamental-Mode Network Behaviors.- 12.4 Direct Behaviors.- 12.5 Serial Behaviors.- 13 Limitations of Up-Bounded Delay Models.- 13.1 Delay-Insensitivity in Fundamental Mode.- 13.2 Composite Functions.- 13.3 Main Theorem for Fundamental Mode.- 13.4 Delay-Insensitivity in Input/Output Mode.- 13.5 Concluding Remarks.- 14 Symbolic Analysis.- 14.1 Representing Boolean Functions.- 14.2 Symbolic Representations.- 14.3 Deriving Symbolic Behaviors.- 14.4 Symbolic Race Analysis.- 14.5 Symbolic Verification of Realization.- 14.6 Symbolic Model Checking.- 15 Design of Asynchronous Circuits.- 15.1 Introduction.- 15.2 Fundamental-Mode Huffman Circuits.- 15.3 Hollaar Circuits.- 15.4 Burst-Mode Circuits.- 15.5 Module Synthesis Using I-Nets.- 15.6 Signal Transition Graphs.- 15.7 Change Diagrams.- 15.8 Protocols in DI Circuits.- 15.9 Ebergen’s Trace Theory Method.- 15.10 Compilation of Communicating Processes.- 15.11 Handshake Circuits.- 15.12 Module-Based Compilation Systems.- 15.13 DCVSL and Interconnection Modules.- 15.14 Micropipelines.- 15.15 Concluding Remarks.- List of Figures.- List of Tables.- List of Mathematical Concepts.