{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:29:46Z","timestamp":1773246586318,"version":"3.50.1"},"reference-count":25,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2025,3,1]]},"DOI":"10.1587\/transfun.2024vlp0002","type":"journal-article","created":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T22:11:35Z","timestamp":1725833495000},"page":"509-516","source":"Crossref","is-referenced-by-count":7,"title":["A Fast Three-Layer One-Side Bottleneck Channel Routing with Layout Constraints Using ILP"],"prefix":"10.1587","volume":"E108.A","author":[{"given":"Kazuya","family":"TANIGUCHI","sequence":"first","affiliation":[{"name":"Tokyo Institute of Technology"}]},{"given":"Satoshi","family":"TAYU","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology"}]},{"given":"Atsushi","family":"TAKAHASHI","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology"}]},{"given":"Mathieu","family":"MOLONGO","sequence":"additional","affiliation":[{"name":"Jedat"}]},{"given":"Makoto","family":"MINAMI","sequence":"additional","affiliation":[{"name":"Jedat"}]},{"given":"Katsuya","family":"NISHIOKA","sequence":"additional","affiliation":[{"name":"Jedat"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] K. Taniguchi, S. Tayu, A. Takahashi, M. Molongo, M. Minami, and K. Nishioka, \u201cThree-layer bottleneck channel track assignment by ILP,\u201d DA Symposium 2023, vol.2023, pp.199-206, 2023 (in Japanese)."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] K. Taniguchi, S. Tayu, A. Takahashi, M. Molongo, M. Minami, and K. Nishioka, \u201cA fast three-layer bottleneck channel track assignment with layout constraints using ILP,\u201d Proc. SASIMI 2024, Taipei, Taiwan, 2024.","DOI":"10.1587\/transfun.2024VLP0002"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] B. Chehab, O. Zografos, E. Litta, Z. Ahmed, P. Schuddinck, D. Jang, G. Hellings, A. Spessot, P. Weckx, and J. Ryckaert, \u201cTwo-level MOL and VHV routing style to enable extreme height scaling beyond 2\u2006nm technology node,\u201d Proc. 2021 IEEE International Interconnect Technology Conference, pp.1-3, IEEE, 2021. 10.1109\/iitc51362.2021.9537557","DOI":"10.1109\/IITC51362.2021.9537557"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] A. Kahng, J. Lienig, I. Markov, and J. Hu, VLSI Physical Design: From Graph Partitioning to Timing Closure, Springer, 2011. 10.1007\/978-90-481-9591-6","DOI":"10.1007\/978-90-481-9591-6"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] A. Hashimoto and J. Stevens, \u201cWire routing by optimizing channel assignment within large apertures,\u201d Proc. 8th Design Automation Workshop, pp.155-169, 1971. 10.1145\/800158.805069","DOI":"10.1145\/800158.805069"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] D.N. Deutsch, \u201cA \u201cDogleg\u201d channel router,\u201d Proc. 13th Design Automation Conference, pp.425-433, 1976. 10.1145\/800146.804843","DOI":"10.1145\/800146.804843"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] T. Yoshimura and E.S. Kuh, \u201cEfficient algorithms for channel routing,\u201d IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol.1, no.1, pp.25-35, 1982. 10.1109\/tcad.1982.1269993","DOI":"10.1109\/TCAD.1982.1269993"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] T.T. Ho, S. Iyengar, and S.Q. Zheng, \u201cA general greedy channel routing algorithm,\u201d IEEE Trans. Comput-Aided Design Integr. Circuits Syst., vol.10, no.2, pp.204-211, 1991. 10.1109\/43.68407","DOI":"10.1109\/43.68407"},{"key":"9","unstructured":"[9] A. Takahashi and H. Murata, \u201cThree-layer L-shaped channel routing algorithm,\u201d IPSJ Journal, vol.40, no.4, pp.1618-1625, 1999 (in Japanese)."},{"key":"10","unstructured":"[10] Y. Takashima, A. Takahashi, and Y. Kajitani, \u201cAssignment of intervals to parallel tracks with minimum total cross-talk,\u201d IEICE Trans. Fundamentals, vol.E81-A, no.9, pp.1909-1915, 1998."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] Z. Wang, M. Shimoda, and A. Takahashi, \u201cSDG channel routing to minimize wirelength for generalized channel,\u201d IEICE Trans. Fundamentals, vol.108, 2025 (submitted).","DOI":"10.1587\/transfun.2024VLP0001"},{"key":"12","unstructured":"[13] A. Takahashi and Y. Kajitani, \u201cA switch-box router \u2018BOX-PEELER\u2019 and its tractable problems,\u201d Trans. IEICE, vol.E72, no.12, pp.1367-1373, Dec. 1989."},{"key":"13","unstructured":"[14] Y. Takashima, A. Takahashi, and Y. Kajitani, \u201cRoutability of FPGAs with extremal switch-block structures,\u201d IEICE Trans. Fundamentals, vol.E81-A, no.5, pp.850-856, May 1998."},{"key":"14","doi-asserted-by":"publisher","unstructured":"[15] Y. Kajitani, \u201cOrder of channels for safe routing and optimal compaction of routing area,\u201d IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol.2, no.4, pp.293-300, 1983. 10.1109\/tcad.1983.1270047","DOI":"10.1109\/TCAD.1983.1270047"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[16] W.M. Dai, T. Asano, and E.S. Kuh, \u201cRouting region definition and ordering scheme for building-block layout,\u201d IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol.4, no.3, pp.189-197, 1985. 10.1109\/tcad.1985.1270114","DOI":"10.1109\/TCAD.1985.1270114"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[17] D.F. Wong and C.L. Liu, \u201cA new algorithm for floorplan designs,\u201d Proc. 23rd ACM\/IEEE Design Automation Conference, pp.101-107, 1986. 10.1109\/dac.1986.1586075","DOI":"10.1109\/DAC.1986.1586075"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[18] C.Y. Lee, \u201cAn algorithm for path connection and its application,\u201d IRE Trans. Electron. Comput., vol.EC-10, no.3, pp.346-365, 1961. 10.1109\/tec.1961.5219222","DOI":"10.1109\/TEC.1961.5219222"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[19] P.E. Hart, N.J. Nilsson, and B. Raphael, \u201cA formal basis for the heuristic determination of minimal cost paths,\u201d IEEE Trans. Syst. Sci. Cybern., vol.4, no.2, pp.100-107, 1968. 10.1109\/tssc.1968.300136","DOI":"10.1109\/TSSC.1968.300136"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[20] W. Dees and P. Karger, \u201cAutomated rip-up and reroute techniques,\u201d Proc. 19th Design Automation Conference, pp.433-439, 1982. 10.1109\/dac.1982.1585535","DOI":"10.1109\/DAC.1982.1585535"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[21] Y. Kohira and A. Takahashi, \u201cCAFE router: A fast connectivity aware multiple nets routing algorithm for routing grid with obstacles,\u201d IEICE Trans. Fundamentals, vol.E93-A, no.12, pp.2380-2388, Dec. 2010. 10.1587\/transfun.e93.a.2380","DOI":"10.1587\/transfun.E93.A.2380"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[22] S. Sato, K. Akagi, and A. Takahashi, \u201cA fast length matching routing pattern generation method for set-pair routing problem using selective pin-pair connections,\u201d IEICE Trans. Fundamentals, vol.E103-A, no.9, pp.1037-1044, Sept. 2020. 10.1587\/transfun.2019kep0015","DOI":"10.1587\/transfun.2019KEP0015"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[23] G. Posser, E.F. Young, S. Held, Y.L. Li, and D.Z. Pan, \u201cChallenges and approaches in VLSI routing,\u201d Proc. 2022 International Symposium on Physical Design, pp.185-192, 2022. 10.1145\/3505170.3511477","DOI":"10.1145\/3505170.3511477"},{"key":"23","unstructured":"[24] K. Taniguchi, S. Tayu, A. Takahashi, Y. Todoroki, and M. Minami, \u201cBottleneck channel routing to reduce the area of analog VLSI,\u201d Proc. SASIMI 2022, Hirosaki, Japan, pp.26-31, 2022."},{"key":"24","doi-asserted-by":"publisher","unstructured":"[25] K. Taniguchi, S. Tayu, A. Takahashi, M. Molongo, M. Minami, and K. Nishioka, \u201cTwo-layer bottleneck channel track assignment for analog VLSI,\u201d IPSJ Trans. System LSI Design Methodology, vol.17, pp.67-76, 2024. 10.2197\/ipsjtsldm.17.67","DOI":"10.2197\/ipsjtsldm.17.67"},{"key":"25","unstructured":"[26] IBM, \u201cUser\u2019s Manual for CPLEX,\u201d https:\/\/www.ibm.com\/docs\/en\/icos\/22.1.1?topic=optimizers-users-manual-cplex, 2022 (Accessed on May 25, 2024)."}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/3\/E108.A_2024VLP0002\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T03:32:01Z","timestamp":1740799921000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/3\/E108.A_2024VLP0002\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,1]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2024vlp0002","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,1]]},"article-number":"2024VLP0002"}}