Optimization Techniques for PCB Escape Routing and Double Patterning-Aware Chip Routing
博士 === 國立清華大學 === 資訊工程學系 === 103 === As the technology node scales down to nanometer range, packages and chips both face many challenges in physical design and manufacturing process. With the increasing complexity of circuit design in recent years, package pin assignment and printed circuit board (P...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/04235751450578301148 |
id |
ndltd-TW-103NTHU5392092 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-103NTHU53920922016-08-15T04:17:33Z http://ndltd.ncl.edu.tw/handle/04235751450578301148 Optimization Techniques for PCB Escape Routing and Double Patterning-Aware Chip Routing 印刷電路板脫離繞線和考慮雙重曝光晶片繞線的最佳化技術 Lei, Seong I 李尚貽 博士 國立清華大學 資訊工程學系 103 As the technology node scales down to nanometer range, packages and chips both face many challenges in physical design and manufacturing process. With the increasing complexity of circuit design in recent years, package pin assignment and printed circuit board (PCB) escape routing have become extremely difficult due to the fast increasing pin count of a package. However, most previous works often treat the pin assignment and the escape routing as two independent problems without a global view of co-design. Besides packages, a new challenge arises in the manufacturing process of a chip. Single-exposure immersion lithography has difficulty in printing the layout pattern under 22nm technology node and beyond. Double patterning lithography (DPL) has emerged as a promising solution to print layout pattern for sub-22nm technology nodes. It is desired to consider DPL during the detailed routing stage so that the layout can be decomposed effortlessly with the minimum number of stitches. In this dissertation, we propose three optimization techniques to solve the physical design problems including the PCB escape routing and chip-level double patterning-aware detailed routing. First, we propose a simultaneous approach that can solve the constrained pin assignment and escape routing for an FPGA package on a through-via-based PCB. Second, we address the pin assignment and escape routing for a package on a blind-via-based PCB. We propose a pin assignment and blind-via usage co-optimization algorithm and a simultaneous multi-layer escape routing algorithm based on the blind-via technology. Finally, we propose a double patterning-aware detailed routing algorithm to balance the mask usage. Extensive experimental results show that our proposed optimization techniques are effective and efficient for PCB escape routing and double patterning-aware chip routing. Mak, Wai Kei 麥偉基 2015 學位論文 ; thesis 97 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
博士 === 國立清華大學 === 資訊工程學系 === 103 === As the technology node scales down to nanometer range, packages and chips both face many challenges in physical design and manufacturing process. With the increasing complexity of circuit design in recent years, package pin assignment and printed circuit board (PCB) escape routing have become extremely difficult due to the fast increasing pin count of a package. However, most previous works often treat the pin assignment and the escape routing as two independent problems without a global view of co-design.
Besides packages, a new challenge arises in the manufacturing process of a chip. Single-exposure immersion lithography has difficulty in printing the layout pattern under 22nm technology node and beyond. Double patterning lithography (DPL) has emerged as a promising solution to print layout pattern for sub-22nm technology nodes. It is desired to consider DPL during the detailed routing stage so that the layout can be decomposed effortlessly with the minimum number of stitches.
In this dissertation, we propose three optimization techniques to solve the physical design problems including the PCB escape routing and chip-level double patterning-aware detailed routing. First, we propose a simultaneous approach that can solve the constrained pin assignment and escape routing for an FPGA package on a through-via-based PCB. Second, we address the pin assignment and escape routing for a package on a blind-via-based PCB. We propose a pin assignment and blind-via usage co-optimization algorithm and a simultaneous multi-layer escape routing algorithm based on the blind-via technology. Finally, we propose a double patterning-aware detailed routing algorithm to balance the mask usage.
Extensive experimental results show that our proposed optimization techniques are effective and efficient for PCB escape routing and double patterning-aware chip routing.
|
author2 |
Mak, Wai Kei |
author_facet |
Mak, Wai Kei Lei, Seong I 李尚貽 |
author |
Lei, Seong I 李尚貽 |
spellingShingle |
Lei, Seong I 李尚貽 Optimization Techniques for PCB Escape Routing and Double Patterning-Aware Chip Routing |
author_sort |
Lei, Seong I |
title |
Optimization Techniques for PCB Escape Routing and Double Patterning-Aware Chip Routing |
title_short |
Optimization Techniques for PCB Escape Routing and Double Patterning-Aware Chip Routing |
title_full |
Optimization Techniques for PCB Escape Routing and Double Patterning-Aware Chip Routing |
title_fullStr |
Optimization Techniques for PCB Escape Routing and Double Patterning-Aware Chip Routing |
title_full_unstemmed |
Optimization Techniques for PCB Escape Routing and Double Patterning-Aware Chip Routing |
title_sort |
optimization techniques for pcb escape routing and double patterning-aware chip routing |
publishDate |
2015 |
url |
http://ndltd.ncl.edu.tw/handle/04235751450578301148 |
work_keys_str_mv |
AT leiseongi optimizationtechniquesforpcbescaperoutinganddoublepatterningawarechiprouting AT lǐshàngyí optimizationtechniquesforpcbescaperoutinganddoublepatterningawarechiprouting AT leiseongi yìnshuādiànlùbǎntuōlíràoxiànhékǎolǜshuāngzhòngpùguāngjīngpiànràoxiàndezuìjiāhuàjìshù AT lǐshàngyí yìnshuādiànlùbǎntuōlíràoxiànhékǎolǜshuāngzhòngpùguāngjīngpiànràoxiàndezuìjiāhuàjìshù |
_version_ |
1718376231536164864 |