定價: | ¥ 85 | ||
作者: | (瑞士)克斯林 著 | ||
出版: | 人民郵電出版社 | ||
書號: | 9787115223586 | ||
語言: | 英文原版 | ||
日期: | 2010-05-01 | ||
版次: | 1 | 頁數: | 845 |
開本: | 16開 | 查看: | 0次 |

服務商城 | 客服電話 | 配送服務 | 優惠價 | 購買 |
![]() | 400-711-6699 | 滿29至69元,免運費! | ¥85 | ![]() |
本書從架構與算法講起,介紹了功能驗證、VHDL建模、同步電路設計、異步數據獲取、能耗與散熱、信號完整性、物理設計、設計驗證等必備技術,還講解了VLSI經濟運作與項目管理,并簡單闡釋了CMOS技術的基礎知識,全面覆蓋了數字集成電路的整個設計開發過程。
本書既可作為高等院校微電子、電子技術等相關專業高年級師生和研究生的參考教材,也可供半導體行業工程師參考。
本書既可作為高等院校微電子、電子技術等相關專業高年級師生和研究生的參考教材,也可供半導體行業工程師參考。
Chapter 1 Introduction to Microelectronics
1.1 Economic impact
1.2 Concepts and terminology
1.2.1 The Guinness book of records point of view
1.2.2 The marketing point of view
1.2.3 The fabrication point of view
1.2.4 The design engineer's point of view
1.2.5 The business point of view
1.3 Design flow in digital VLSI
1.3.1 The Y-chart, a map of digital electronic systems
1.3.2 Major stages in VLSI design
1.3.3 Cell libraries
1.3.4 Electronic design automation software
1.4 Field-programmable logic
1.4.1 Configuration technologies
1.4.2 Organization of hardware resources
1.4.3 Commercial products
1.5 Problems
1.6 Appendix I: A brief glossary of logic families
1.7 Appendix II: An illustrated glossary of circuit-related terms
Chapter 2 From Algorithms to Architectures
2.1 The goals of architecture design
2.1.1 Agenda
2.2 The architectural antipodes
2.2.1 What makes an algorithm suitable for a dedicated VLSI architecture?
2.2.2 There is plenty of land between the architectural antipodes
2.2.3 Assemblies of general-purpose and dedicated processing units
2.2.4 Coprocessors
2.2.5 Application-specific instruction set processors
2.2.6 Configurable computing
2.2.7 Extendable instruction set processors
2.2.8 Digest
2.3 A transform approach to VLSI architecture design
2.3.1 There is room for remodelling in the algorithmic domain 62
2.3.2 ...and there is room in the architectural domain
2.3.3 Systems engineers and VLSI designers must collaborate
2.3.4 A graph-based formalism for describing processing algorithms
2.3.5 The isomorphic architecture
2.3.6 Relative merits of architectural alternatives
2.3.7 Computation cycle versus clock period
2.4 Equivalence transforms for combinational computations
2.4.1 Common assumptions
2.4.2 Iterative decomposition
2.4.3 Pipelining
2.4.4 Replication
2.4.5 Time sharing
2.4.6 Associativity transform
2.4.7 Other algebraic transforms
2.4.8 Digest
2.5 Options for temporary storage of data
2.5.1 Data access patterns
2.5.2 Available memory configurations and area occupation
2.5.3 Storage capacities
2.5.4 Wiring and the costs of going off-chip
2.5.5 Latency and timing
2.5.6 Digest
2.6 Equivalence transforms for nonrecursive computations
2.6.1 Retiming
2.6.2 Pipelining revisited
2.6.3 Systolic conversion
2.6.4 Iterative decomposition and time-sharing revisited
2.6.5 Replication revisited
2.6.6 Digest
2.7 Equivalence transforms for recursive computations
2.7.1 The feedback bottleneck
2.7.2 Unfolding of first-order loops
2.7.3 Higher-order loops
2.7.4 Time-variant loops
2.7.5 Nonlinear or general loops
2.7.6 Pipeline interleaving is not an equivalence transform
2.7.7 Digest
2.8 Generalizations of the transform approach
2.8.1 Generalization to other levels of detail
2.8.2 Bit-serial architectures
2.8.3 Distributed arithmetic
2.8.4 Generalization to other algebraic structures
2.8.5 Digest
2.9 Conclusions
2.9.1 Summary
2.9.2 The grand architectural alternatives from an energy point of view
2.9.3 A guide to evaluating architectural alternatives
2.10 Problems
2.11 Appendix I: A brief glossary of algebraic structures
2.12 Appendix II: Area and delay figures of VLSI subfunctions
Chapter 3 Functional Verification
Chapter 4 Modelling Hardware with VHDL
Chapter 5 The Case for Synchronous Design
Chapter 6 Clocking of Synchronous Circuits
Chapter 7 Acquisition of Asynchronous Data
Chapter 8 Gate- and Transistor-Level Design
Chapter 9 Energy Efficiency and Heat Removal
Chapter 10 Signal Integrity
Chapter 11 Physical Design
Chapter 12 Design Verification
Chapter 13 VLSI Economics and Project Management
Chapter 14 A Primer on CMOS Technology
Chapter 15 Outlook
Appendix A Elementary Digital Electronics
Appendix B Finite State Machines
Appendix C VLSI Designer’s Checklist
Appendix D Symbols and constants
References
Index
1.1 Economic impact
1.2 Concepts and terminology
1.2.1 The Guinness book of records point of view
1.2.2 The marketing point of view
1.2.3 The fabrication point of view
1.2.4 The design engineer's point of view
1.2.5 The business point of view
1.3 Design flow in digital VLSI
1.3.1 The Y-chart, a map of digital electronic systems
1.3.2 Major stages in VLSI design
1.3.3 Cell libraries
1.3.4 Electronic design automation software
1.4 Field-programmable logic
1.4.1 Configuration technologies
1.4.2 Organization of hardware resources
1.4.3 Commercial products
1.5 Problems
1.6 Appendix I: A brief glossary of logic families
1.7 Appendix II: An illustrated glossary of circuit-related terms
Chapter 2 From Algorithms to Architectures
2.1 The goals of architecture design
2.1.1 Agenda
2.2 The architectural antipodes
2.2.1 What makes an algorithm suitable for a dedicated VLSI architecture?
2.2.2 There is plenty of land between the architectural antipodes
2.2.3 Assemblies of general-purpose and dedicated processing units
2.2.4 Coprocessors
2.2.5 Application-specific instruction set processors
2.2.6 Configurable computing
2.2.7 Extendable instruction set processors
2.2.8 Digest
2.3 A transform approach to VLSI architecture design
2.3.1 There is room for remodelling in the algorithmic domain 62
2.3.2 ...and there is room in the architectural domain
2.3.3 Systems engineers and VLSI designers must collaborate
2.3.4 A graph-based formalism for describing processing algorithms
2.3.5 The isomorphic architecture
2.3.6 Relative merits of architectural alternatives
2.3.7 Computation cycle versus clock period
2.4 Equivalence transforms for combinational computations
2.4.1 Common assumptions
2.4.2 Iterative decomposition
2.4.3 Pipelining
2.4.4 Replication
2.4.5 Time sharing
2.4.6 Associativity transform
2.4.7 Other algebraic transforms
2.4.8 Digest
2.5 Options for temporary storage of data
2.5.1 Data access patterns
2.5.2 Available memory configurations and area occupation
2.5.3 Storage capacities
2.5.4 Wiring and the costs of going off-chip
2.5.5 Latency and timing
2.5.6 Digest
2.6 Equivalence transforms for nonrecursive computations
2.6.1 Retiming
2.6.2 Pipelining revisited
2.6.3 Systolic conversion
2.6.4 Iterative decomposition and time-sharing revisited
2.6.5 Replication revisited
2.6.6 Digest
2.7 Equivalence transforms for recursive computations
2.7.1 The feedback bottleneck
2.7.2 Unfolding of first-order loops
2.7.3 Higher-order loops
2.7.4 Time-variant loops
2.7.5 Nonlinear or general loops
2.7.6 Pipeline interleaving is not an equivalence transform
2.7.7 Digest
2.8 Generalizations of the transform approach
2.8.1 Generalization to other levels of detail
2.8.2 Bit-serial architectures
2.8.3 Distributed arithmetic
2.8.4 Generalization to other algebraic structures
2.8.5 Digest
2.9 Conclusions
2.9.1 Summary
2.9.2 The grand architectural alternatives from an energy point of view
2.9.3 A guide to evaluating architectural alternatives
2.10 Problems
2.11 Appendix I: A brief glossary of algebraic structures
2.12 Appendix II: Area and delay figures of VLSI subfunctions
Chapter 3 Functional Verification
Chapter 4 Modelling Hardware with VHDL
Chapter 5 The Case for Synchronous Design
Chapter 6 Clocking of Synchronous Circuits
Chapter 7 Acquisition of Asynchronous Data
Chapter 8 Gate- and Transistor-Level Design
Chapter 9 Energy Efficiency and Heat Removal
Chapter 10 Signal Integrity
Chapter 11 Physical Design
Chapter 12 Design Verification
Chapter 13 VLSI Economics and Project Management
Chapter 14 A Primer on CMOS Technology
Chapter 15 Outlook
Appendix A Elementary Digital Electronics
Appendix B Finite State Machines
Appendix C VLSI Designer’s Checklist
Appendix D Symbols and constants
References
Index