{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:15:26Z","timestamp":1757312126183,"version":"3.38.0"},"reference-count":20,"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.2024vlp0001","type":"journal-article","created":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T22:15:01Z","timestamp":1736374501000},"page":"500-508","source":"Crossref","is-referenced-by-count":4,"title":["SDG Channel Routing to Minimize Wirelength for Generalized Channel"],"prefix":"10.1587","volume":"E108.A","author":[{"given":"Zezhong","family":"WANG","sequence":"first","affiliation":[{"name":"Tokyo Institute of Technology"}]},{"given":"Masayuki","family":"SHIMODA","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology"}]},{"given":"Atsushi","family":"TAKAHASHI","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] Z. Wang, M. Shimoda, and A. Takahashi, \u201cSingle trunk routing problem for generalized channel,\u201d IEICE Technical Report, VLD2023-104, 2024."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] G. Posser, E.F. Young, S. Held, Y.L. Li, and D.Z. Pan, \u201cChallenges and approaches in VLSI routing,\u201d Proc. International Symposium on Physical Design (ISPD), pp.185-192, 2022. 10.1145\/3505170.3511477","DOI":"10.1145\/3505170.3511477"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] M. Sako, T. Nakajima, F. Kono, T. Nakano, M. Fujiu, J. Musha, D. Nakamura, N. Kanagawa, Y. Shimizu, K. Yanagidaira, T. Utsumi, T. Kawano, Y. Hosomura, H. Yabe, M. Kano, H. Sugawara, A.H. Sravan, K. Hayashi, T. Kouchi, and Y. Watanabe, \u201cA 1\u2006Tb 3b\/cell 3D-flash memory of more than 17\u2006Gb\/mm<sup>2<\/sup> bit density with 3.2\u2006Gbps interface and 205\u2006MB\/s program throughput,\u201d 2023 IEEE Symposium on VLSI Technology and Circuits (VLSI Technology and Circuits), pp.1-2, June 2023. 10.23919\/vlsitechnologyandcir57934.2023.10185237","DOI":"10.23919\/VLSITechnologyandCir57934.2023.10185237"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] S. Kobayashi, K. Tashiro, Y. Minemura, K. Nakagami, K. Arita, T. Oohashi, K. Funayama, H. Sakai, M. Mushiga, K. Okabe, Y. Kanno, S. Shimizu, E. Fujikura, A. Nakae, K. Yamaguchi, H. Yamawaki, K. Nakajima, and M. Sato, \u201cHigh peformance 3D flash memory with 3.2\u2006Gbps interface and 205\u2006MB\/s program throughput based on CBA (CMOS directly bonded to array) technology,\u201d 2023 International Electron Devices Meeting (IEDM), pp.1-4, 2023. 10.1109\/iedm45741.2023.10413716","DOI":"10.1109\/IEDM45741.2023.10413716"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] M. Tagami, \u201cCMOS directly bonded to array (CBA) technology for future 3D flash memory,\u201d 2023 International Electron Devices Meeting (IEDM), pp.1-4, 2023. 10.1109\/iedm45741.2023.10413718","DOI":"10.1109\/IEDM45741.2023.10413718"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] Z. Wang, M. Shimoda, and A. Takahashi, \u201cBCA channel routing to minimize wirelength for generalized channel problem,\u201d 2024 IEEE International Symposium on Circuits and Systems (ISCAS), pp.1-5, 2024. 10.1109\/iscas58744.2024.10558428","DOI":"10.1109\/ISCAS58744.2024.10558428"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] A. Hashimoto and J. Stevens, \u201cWire routing by optimizing channel assignment within large apertures,\u201d Proc. 8th Design Automation Workshop (DAC), pp.155-169, 1971. 10.1145\/800158.805069","DOI":"10.1145\/800158.805069"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] D.N. Deutsch, \u201cA \u201cdogleg\u201d channel router,\u201d Proc. 13th Design Automation Conference (DAC), pp.425-433, 1976. 10.1145\/800146.804843","DOI":"10.1145\/800146.804843"},{"key":"9","unstructured":"[9] A.S. LaPaugh, \u201cAlgorithms for integrated cricuit layout: An analytic approach,\u201d Ph.D. thesis, Massachusetts Institute of Technology, USA, 1980."},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] T. Yoshimura and E. Kuh, \u201cEfficient algorithms for channel routing,\u201d IEEE Trans. Comput.-Aided Design of Integr. Circuits Syst., vol.1, no.1, pp.25-35, 1982. 10.1109\/tcad.1982.1269993","DOI":"10.1109\/TCAD.1982.1269993"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] T. Szymanski, \u201cDogleg channel routing is NP-complete,\u201d IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol.4, no.1, pp.31-41, 1985. 10.1109\/tcad.1985.1270096","DOI":"10.1109\/TCAD.1985.1270096"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] 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":"13","unstructured":"[13] 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":"14","doi-asserted-by":"crossref","unstructured":"[14] S.S. Sau, A. Pal, T.N. Mandal, A.K. Datta, R.K. Pal, and A. Chaudhuri, \u201cA graph based algorithm to minimize total wire length in VLSI channel routing,\u201d IEEE International Conference on Computer Science and Automation Engineering, pp.61-65, 2011. 10.1109\/csae.2011.5952634","DOI":"10.1109\/CSAE.2011.5952634"},{"key":"15","unstructured":"[15] K. Taniguchi, S. Tayu, A. Takahashi, Y. Todoroki, and M. Minami, \u201cBottleneck channel routing to reduce the area of analog VLSI,\u201d Proc. 24th Workshop on Synthesis And System Integration of Mixed Information technologies (SASIMI), pp.26-31, 2022."},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] 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. 25th Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI), pp.50-55, 2024.","DOI":"10.1587\/transfun.2024VLP0002"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] 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":"18","doi-asserted-by":"publisher","unstructured":"[19] M. Borah, R. Owens, and M. Irwin, \u201cAn edge-based heuristic for Steiner routing,\u201d IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol.13, no.12, pp.1563-1568, 1994. 10.1109\/43.331412","DOI":"10.1109\/43.331412"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[20] H. Chen, C. Qiao, F. Zhou, and C.K. Cheng, \u201cRefined single trunk tree: A rectilinear Steiner tree generator for interconnect prediction,\u201d Proc. International Workshop on System-Level Interconnect Prediction (SLIP), pp.85-89, 2002. 10.1145\/505364.505366","DOI":"10.1145\/505348.505366"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[21] S.E.D. Lin and D.H. Kim, \u201cConstruction of all rectilinear Steiner minimum trees on the Hanan grid and its applications to VLSI design,\u201d IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol.39, no.6, pp.1165-1176, 2020. 10.1109\/tcad.2019.2917896","DOI":"10.1109\/TCAD.2019.2917896"}],"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_2024VLP0001\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T03:31:43Z","timestamp":1740799903000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/3\/E108.A_2024VLP0001\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,1]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2024vlp0001","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"type":"print","value":"0916-8508"},{"type":"electronic","value":"1745-1337"}],"subject":[],"published":{"date-parts":[[2025,3,1]]},"article-number":"2024VLP0001"}}