https://scholars.lib.ntu.edu.tw/handle/123456789/580980
標題: | SAT-Based On-Track Bus Routing | 作者: | Zhang H.-T Fujita M Cheng C.-K JIE-HONG JIANG |
關鍵字: | Software design; Boolean satisfiability; Complex designs; Critical Paths; High quality; Maze routing; Minimizing the number of; Overall costs; State of the art; Buses | 公開日期: | 2021 | 卷: | 40 | 期: | 4 | 起(迄)頁: | 735-747 | 來源出版物: | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems | 摘要: | In modern integrated circuit design, bus routing is a challenge because of complex design rules and wiring constraints. Despite extensive research, state-of-the-art in bus routing is not effective when nonuniform tracks, various obstacles, wire width constraints, and multiple spacing rules should be handled simultaneously. A new bus routing framework proposed in this article is based on maze routing and Boolean satisfiability. It produces high-quality results quickly and allows for additional optimizations, such as minimizing wire length on the critical paths. A number of challenging bus routing benchmarks appeared in 2018 ICCAD Contest. Experiments on these benchmarks not only show that the framework is faster than the winners of the competition and previous work but also produces better results, improving the overall cost by 12% while at the same time minimizing the number of spacing violations. ? 1982-2012 IEEE. |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85091382900&doi=10.1109%2fTCAD.2020.3007253&partnerID=40&md5=e0e7e9bcfd9d4d108bcc88a5b02585c6 https://scholars.lib.ntu.edu.tw/handle/123456789/580980 |
ISSN: | 02780070 | DOI: | 10.1109/TCAD.2020.3007253 |
顯示於: | 電機工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。