Home>Store

VLSI Design Methodology Development

Register your productto gain access to bonus material or receive a coupon.

VLSI Design Methodology Development

eBook (Watermarked)

  • Your Price: $81.60
  • List Price: $96.00
  • About Watermarked eBooks
  • This PDF will be accessible from yourAccountpage after purchase and requires the freeAdobe® Reader®software to read it.

    The eBook requires no passwords or activation to read. We customize your eBook by discreetly watermarking it with your name, making it uniquely yours.

    Watermarked eBook FAQ

Description

  • Copyright 2019
  • Pages: 752
  • 版本:1
  • eBook (Watermarked)
  • ISBN-10: 0-13-573474-6
  • ISBN-13: 978-0-13-573474-2

The Complete, Modern Tutorial on Practical VLSI Chip Design, Validation, and Analysis

As microelectronics engineers design complex chips using existing circuit libraries, they must ensure correct logical, physical, and electrical properties, and prepare for reliable foundry fabrication.VLSI Design Methodology Developmentfocuses on the design and analysis steps needed to perform these tasks and successfully complete a modern chip design.

Microprocessor design authority Tom Dillinger carefully introduces core concepts, and then guides engineers through modeling, functional design validation, design implementation, electrical analysis, and release to manufacturing. Writing from the engineer’s perspective, he covers underlying EDA tool algorithms, flows, criteria for assessing project status, and key tradeoffs and interdependencies. This fresh and accessible tutorial will be valuable to all VLSI system designers, senior undergraduate or graduate students of microelectronics design, and companies offering internal courses for engineers at all levels.

  • Reflect complexity, cost, resources, and schedules in planning a chip design project
  • Perform hierarchical design decomposition, floorplanning, and physical integration, addressing DFT, DFM, and DFY requirements
  • Model functionality and behavior, validate designs, and verify formal equivalency
  • 应用EDA工具逻辑合成,放置d routing
  • Analyze timing, noise, power, and electrical issues
  • Prepare for manufacturing release and bring-up, from mastering ECOs to qualification

This guide is for all VLSI system designers, senior undergraduate or graduate students of microelectronics design, and companies offering internal courses for engineers at all levels. It is applicable to engineering teams undertaking new projects and migrating existing designs to new technologies.

Sample Content

Table of Contents

Preface xiv
TOPIC I: OVERVIEW OF VLSI DESIGN METHODOLOGY 1
I.1 Methodology Guidelines for Logical and Physical Design Hierarchy Correspondence 6
I.2 Managing Inter-Block Glue Logic 8
Chapter 1 Introduction 13
1.1 Definitions 13
1.2 Intellectual Property (IP) Models 21
1.3 Tapeout and NRE Fabrication Cost 42
1.4 Fabrication Technology 44
1.5 Power and Clock Domains On-chip 105
1.6 Physical Design Planning 113
1.7 Summary 126
References 127
Further Research 129
Chapter 2 VLSI Design Methodology 131
2.1 IP Design Methodology 131
2.2 SoC Physical Design Methodology 141
2.3 EDA Tool and Release Flow Management 165
2.4 Design Methodology “Trailblazing” and Reference Flows 168
2.5 Design Data Management (DDM) 171
2.6 Power and Clock Domain Management 175
2.7 Design for Testability (DFT) 177
2.8 Design-for-Manufacturability (DFM) and Design-for-Yield (DFY) Requirements 184
2.9 Design Optimization 185
2.10 Methodology Checks 186
References 190
Further Research 190
Chapter 3 Hierarchical Design Decomposition 193
3.1 Logical-to-Physical Correspondence 193
3.2 Division of SRAM Array Versus Non-Array Functionality 197
3.3 Division of Dataflow and Control Flow Functionality 198
3.4 Design Block Size for Logic Synthesis and Physical Design 202
3.5电源和时钟域206年考虑
3.6 Opportunities for Reuse of Hierarchical Units 207
3.7 Automated Test Pattern Generation (ATPG) Limitations 208
3.8 Intangibles 211
3.9 The Impact of Changes to the SoC Model Hierarchy During Design 212
3.10 Generating Hierarchical Electrical Abstracts Versus Top-Level Flat Analysis 214
3.11 Methodologies for Top-Level Logical and Physical Hierarchies 216
3.12 Summary 218
References 219
Further Research 219

TOPIC II: MODELING 221
Chapter 4 Cell and IP Modeling 223

4.1 Functional Modeling for Cells and IP 223
4.2 Physical Models for Library Cells 240
4.3 Library Cell Models for Analysis Flows 241
4.4 Design for End-of-Life (EOL) Circuit Parameter Drift 251
4.5 Summary 253
References 253
Further Research 254

TOPIC III: DESIGN VALIDATION 257
Chapter 5 Characteristics of Functional Validation 259

5.1 Software Simulation 259
5.2 Testbench Stimulus Development 262
5.3 Hardware-Accelerated Simulation: Emulation and Prototyping 268
5.4 Behavioral Co-simulation 275
5.5 Switch-Level and Symbolic Simulation 275
5.6 Simulation Throughput and Resource Planning 281
5.7 Validation of Production Test Patterns 284
5.8 Event Trace Logging 288
5.9 Model Coverage Analysis 289
5.10 Switching Activity Factor Estimates for Power Dissipation Analysis 295
5.11 Summary 296
References 297
Further Research 298
Chapter 6 Characteristics of Formal Equivalency Verification 301
6.1 RTL Combinational Model Equivalency 301
6.2 State Mapping for Equivalency 302
6.3组合逻辑锥分析305
6.4 Use of Model Input Assertions for Equivalency 306
6.5 Sequential Model Equivalency 307
6.6 Functional and Test-Mode Equivalence Verification 309
6.7 Array Equivalence Verification 310
6.8 Summary 313
References 314
Further Research 314

TOPIC IV: DESIGN IMPLEMENTATION 317
Chapter 7 Logic Synthesis 319

7.1 Level of Hardware Description Language Modeling 319
7.2 Generation and Verification of Timing Constraints 320
7.3 Technology Mapping to the Cell Library 328
7.4 Signal Repowering and “High-Fan-out” Net Synthesis (HFNS) 335
7.5 Post-Synthesis Netlist Characteristics 339
7.6 Synthesis with a Power Format File 340
7.7 Post-Technology Mapping Optimizations for Timing and Power 343
7.8 Hold Timing Optimization 348
7.9 Clock Tree Synthesis (CTS) 350
7.10 Integration of Hard IP Macros in Synthesis 353
7.11 Low-Effort Synthesis (LES) Methodology 354
7.12 Summary 359
References 360
Further Research 360
Chapter 8 Placement 363
8.1 Global Floorplanning of Hierarchical Units 363
8.2 Parasitic Interconnect Estimation 366
8.3 Cell Placement 367
8.4 Clock Tree Local Buffer Placement 369
8.5 Summary 370
References 370
Further Research 370
Chapter 9 Routing 373
9.1 Routing Introduction 373
9.2 Global and Detailed Routing Phases 378
9.3 Back End Of Line Interconnect “Stacks” 383
9.4 Routing Optimizations 387
9.5 Summary 399
References 400
Further Research 400

TOPIC V: ELECTRICAL ANALYSIS 403
Chapter 10 Layout Parasitic Extraction and Electrical Modeling 405

10.1 Introduction 405
10.2 Cell- and Transistor-Level Parasitic Modeling for Cell Characterization 411
10.3 Decoupling Capacitance Calculation for Power Grid Analysis 431
10.4 Interconnect Extraction 433
10.5 “Selected Net” Extraction Options 438
10.6 RLC Modeling 439
10.7 Summary 439
References 440
Further Research 442
Chapter 11 Timing Analysis 443
11.1 Cell Delay Calculation 443
11.2 Interconnect Delay Calculation 446
11.3 Electrical Design Checks 452
11.4 Static Timing Analysis 453
11.5 Summary 469
References 470
Further Research 472
Chapter 12 Noise Analysis 475
12.1 Introduction to Noise Analysis 475
12.2 Static Noise Analysis, Part I 476
12.3 Noise Impact on Delay 481
12.4 Electrical Models for Static Noise Analysis 485
12.5 Static Noise Analysis, Part II 488
12.6 Summary 491
References 492
Further Research 493
Chapter 13 Power Analysis 495
13.1 Introduction to Power Analysis 495
13.2 Models for Switching Activity Power Dissipation 497
13.3 IP Power Models 501
13.4 Device Self-Heat Models 502
13.5 Design-for-Power Feedback from Power Analysis 504
13.6 Summary 505
References 506
Further Research 506
Chapter 14 Power Rail Voltage Drop Analysis 509
14.1 Introduction to Power Rail Voltage Drop Analysis 509
14.2 Static I*R Rail Analysis 512
14.3 Dynamic P/G Voltage Drop Analysis 513
14.4 Summary 526
References 526
Further Research 527
Chapter 15 Electromigration (EM) Reliability Analysis 529
15.1 Introduction to EM Reliability Analysis 529
15.2 Fundamentals of Electromigration 535
15.3 Power Rail Electromigration Analysis: powerEM 545
15.4 Signal Interconnect Electromigration Analysis: sigEM 548
15.5 Summary 555
References 555
Further Research 556
Chapter 16 Miscellaneous Electrical Analysis Requirements 559
16.1 SleepFET Power Rail Analysis 559
16.2 Substrate Noise Injection and Latchup Analysis 562
16.3 Electrostatic Discharge (ESD) Checking 568
16.4 Soft Error Rate (SER) Analysis 576
16.5 Summary 590
References 590
Further Research 591

TOPIC VI: PREPARATION FOR MANUFACTURING RELEASE AND BRING-UP 593
Chapter 17 ECOs 595

17.1 Application of an Engineering Change 595
17.2 ECOs and Equivalency Verification 599
17.3 Use of Post-Silicon Cells for ECOs 600
17.4 ECOs and Design Version Management 602
17.5 Summary 605
References 606
Further Research 606
Chapter 18 Physical Design Verification 607
18.1设计规则检查(DRC) 607
18.2 Layout-Versus-Schematic (LVS) Verification 610
18.3 Electrical Rule Checking (ERC) 616
18.4 Lithography Process Checking (LPC) 618
18.5 DRC Waivers 620
18.6 Summary 622
Further Research 622
Chapter 19 Design for Testability Analysis 625
19.1 Stuck-at Fault Models and Automated Test Pattern Generation (ATPG) 625
19.2 DFT Design Rule Checking 636
19.3 Memory Built-in Self-Test (MBIST) 638
19.4 Logic Built-in Self-Test (LBIST) 645
19.5 Delay Faults 659
19.6 Bridging Faults 664
19.7 Pattern Diagnostics 665
19.8 Summary 672
References 673
Further Research 674
Chapter 20 Preparation for Tapeout 677
20.1 Introduction to Tapeout Preparation 677
20.2 Foundry Interface Release Tapeout Options 678
20.3 Tapeout Checklist Review 684
20.4 Project Tapeout Planning 689
Further Research 692
Chapter 21 Post-Silicon Debug and Characterization (“Bring-up”) and Product Qualification 693
21.1 Systematic Test Fails 693
21.2 “Shmoo” of Performance Dropout Versus Frequency 695
21.3 Product Qualification 698
21.4 Summary 702
Reference 702
Further Research 703
Epilogue 705
Index 711

Updates

Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simplyemailinformation@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through ourContact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

这个网站目前不回应不交易ck signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the帐户页面. If a user no longer desires our service and desires to delete his or her account, please contact us atcustomer-service@informit.comand we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive:www.e-skidka.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information toNevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read ourSupplemental privacy statement for California residentsin conjunction with this Privacy Notice. TheSupplemental privacy statement for California residentsexplains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Pleasecontact usabout this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020