Matching-Based Minimum-Cost Spare Cell Selection for Design Changes
碩士 === 國立交通大學 === 電子工程系所 === 97 === Metal-only ECO realizes the last-minute design changes by revising the photomasks of metal layers only. This task is challenging because the pre-injected spare cells are limited both in number and in cell types. This paper reduces the spare cell selection problem...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/48163012283211482039 |
| Summary: | 碩士 === 國立交通大學 === 電子工程系所 === 97 === Metal-only ECO realizes the last-minute design changes by revising the photomasks of metal layers only. This task is challenging because the pre-injected spare cells are limited both in number and in cell types. This paper reduces the spare cell selection problem into stable marriage problem and uses a matching-based algorithm, named stable matching, that correctly implements the incremental design changes using the available space cells as well as tries to reduce the prohibitive photomask cost at the same time. The experiments are conducted on five industrial testcases. The results shows stable matching uses less photomask costs to complete design changes for all cases than the direct method that transforms the widely-used hand-editing procedure into an automatic one.
|
|---|