Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
Medientyp
Sprache
Region
Bibliothek
Erscheinungszeitraum
Person/Organisation
  • 1
    Online-Ressource
    Online-Ressource
    Amsterdam ; : Elsevier/Academic Press,
    UID:
    almafu_9960073631402883
    Umfang: 1 online resource (110 p.)
    Ausgabe: 1st edition
    ISBN: 9786613839145 , 9781283526692 , 1283526697 , 9780124017078 , 012401707X
    Serie: Elsevier insights
    Inhalt: Precharge logic is used by a variety of industries in applications where processor speed is the primary goal, such as VLSI (very large systems integration) applications. Also called dynamic logic, this type of design uses a clock to synchronize instructions in circuits. This comprehensive book covers the challenges faced by designers when using this logic style, including logic basics, timing, noise considerations, alternative topologies and more. In addition advanced topics such as skew tolerant design are covered in some detail. Overall this is a comprehensive view of precharge logic, whi
    Anmerkung: Description based upon print version of record. , Front Cover; Synchronous Precharge Logic; Copyright Page; Dedication; Contents; List of figures; List of tables; About the author; 1 Precharge Logic Basics; 1.1 Introduction; 1.2 What Is Precharge Logic?; 1.3 Why Is it Faster than Static Logic?; 1.4 Advantages of Precharge Logic; 1.5 What About Using Other Transistors?; 1.6 Domino Logic; 1.6.1 Need for Monotonic Signals; 1.6.2 Domino Logic Gates; 1.7 Keepers: Improving the Charge Storage; 1.8 Final Comments; 2 Timing; 2.1 Clock Skew Penalty; 2.2 Hold-Time Problem; 2.3 Nonoverlapping Clocks; 2.4 A Better Latch; 2.5 Input Setup Criteria , 2.6 Input Hold Criteria2.7 Precharge Timing; 2.8 Skew Tolerant Design; 3 Transistor Sizing; 3.1 Sizing the Pulldown Stack; 3.2 Sizing of the Output Inverter; 3.3 Logical Effort; 3.4 Sizing of the Keeper Device; 3.4.1 PFET Keeper; 3.4.2 NFET Keeper; 3.4.3 Maximum Leakable NFET Width; 3.5 Sizing of the Precharge Device; 3.6 Sizing Precharge Gates with Wires; 4 Noise Tolerance; 4.1 Input-Connected Prechargers; 4.2 Propagated Noise; 4.3 Input Wire Noise; 4.4 Supply-Level Variations; 4.5 Charge Sharing; 4.6 Charge Sharing: Example 1; 4.7 Charge Sharing: Example 2; 4.8 Leakage , 4.9 Clock Coupling on the Internal Dynamic Node4.10 Minority Carrier Charge Injection; 4.11 Alpha Particles; 4.12 Noise Induced on Dynamic Nodes Directly; 4.13 Example of Transistor Crosstalk During Precharge; 4.14 CSR Latch Signal Ordering; 4.15 Interfacing to Transmission Gates; 5 Topology Considerations; 5.1 Limitation on Device Stacking; 5.2 Limitation of Logic Width; 5.3 Use of Low/High Vt Transistors; 5.4 Sharing Evaluation Devices; 5.5 Tapering of the Evaluation Device; 5.6 Footed versus Unfooted; 5.7 Compounding Outputs; 5.8 Late Arriving Input on Top; 5.9 Making Keepers Weak , 5.10 Conditional Keepers5.11 Placement of the Evaluation Device; 6 Other Precharge Logic Styles; 6.1 MODL; 6.2 NORA Logic; 6.3 Postcharge Logic; 6.4 CD Domino; 6.5 NTP Logic; 6.6 Differential Cascode Voltage Switch Logic; 6.7 DCML; 6.8 SOI Precharge Logic; 6.9 Advanced Work; 7 Clocked Set-Reset Latches; 7.1 Memory Special Cases; 7.2 Building a CSR Latch; 7.3 Time Borrowing; 7.4 Hold-Time Margins; 7.4.1 Margin 1; 7.4.2 Margin 2; 7.5 Mintime; 7.6 Alternative Topology; 7.7 The Other Phase; 7.8 Two-Input Latch; 7.9 Adding Scan; 8 Layout Considerations; Appendix: Logical Effort , A.1 Derivation of Delay in a Logic GateA.2 The Logical Effort of a Single Stage; A.3 Multistage Networks; A.4 Minimum Delay; A.5 Best Number of Stages; References , English
    Weitere Ausg.: ISBN 9780123985279
    Weitere Ausg.: ISBN 0123985277
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Meinten Sie 0124017002?
Meinten Sie 082401507x?
Meinten Sie 0124017088?
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz