1 / 20

Isolation Cell Insertion for Low Power Design

Isolation Cell Insertion for Low Power Design. 學生：孫昱人、林俊利 指導教授：劉一宇. Outline. Introduction Analysis Isolation Cell Sharing Algorithm Data Structure Flow Results Analysis. Introduction. Z Z Z . off. B2. B5. ?. B1. B3. B6. ?. B4. Outline. Introduction

haru
Download Presentation

Isolation Cell Insertion for Low Power Design

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Isolation Cell Insertion for Low Power Design 學生：孫昱人、林俊利 指導教授：劉一宇

  2. Outline • Introduction • Analysis • Isolation Cell Sharing • Algorithm • Data Structure • Flow • Results Analysis

  3. Introduction Z Z Z off B2 B5 ? B1 B3 B6 ? B4

  4. Outline • Introduction • Analysis • Isolation Cell Sharing • Algorithm • Data Structure • Flow • Results Analysis

  5. Isolation Cell Sharing Cell clustering at to-domain Use the from-domain cell first to cluster Add additional I/O ports to modules to share isolation cells

  6. Cell Clustering at To-domain C C A A C C

  7. From-domain Cluster First High / isoA B B A A High / isoA C C High / isoA

  8. From and To Comparison B B B High/isoA A A A Using To C C C C C C Using From

  9. Add Additional Ports to Share Port B B High/isoA A C A C C C

  10. Outline • Introduction • Analysis • Isolation Cell Sharing • Algorithm • Data Structure • Flow • Results Analysis

  11. Data Structure TOP module Module Cell • Tree based hierarchical circuit topology • Top module be the root • Record interconnect relations in non-terminal nodes • Advantage: • Elegant & efficient

  12. Start Read design netlist Read library file Read power intent Construct hierarchical circuit topology Traverse from TOP by DFS Wire relation check Need to insert cell? Y Traversal to next module Insert proper isolation cell N All traversed? N Y Output domain mapping Output netlist after isolation cell insertion End Algorithm Flow

  13. Algorithm Flow (cont.) Traverse from TOPby DFS 1. Power domain checking 2. Grouping and net sorting 3. Fan-out domain checking Wire relation check Need to insert cell? Y Traversal to next module Insert proper isolation cell N All traversed? N Y

  14. Power Domain Checking B A C D A →B A →D … A →C … Check the power domains of wire Sort by to-domain

  15. Grouping and Net Sorting En En … Grouping from- and to- domains if there exist useful from-domain isolation cells Sort the from-domain by enable signal To-domainare already sorted

  16. Net Sorting and Insertion(From) … En En En

  17. Net Sorting and Insertion (To) En … En En

  18. Check Fan-Out Domain B B B A →B A →C B A B A C A →B C A C Check domain relation of from-to to decide the isolation cell insertion B A →B A →C C

  19. Outline • Introduction • Analysis • Isolation Cell Sharing • Algorithm • Data Structure • Flow • Results Analysis

  20. Results Analysis Isolation cell count

More Related