Crosstalk-driven and RLC-bounded track assignment algorithms
碩士 === 國立交通大學 === 資訊科學系所 === 94 === In this work, we have proposed crosstalk-driven and RLC-bounded track assignment algorithms. First, RBTA first applies LEA to produces a utilization-driven TA, and then transforms the crosstalk minimization problem into finding a MWHP by the proposed new track ove...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/33118915781385136079 |