Journal of information and communication convergence engineering

  • 제19권2호
  • /
  • Pages.114-119
  • /
  • 2021
  • /
  • 2234-8255(pISSN)
  • /
  • 2234-8883(eISSN)
한국정보통신학회 (The Korea Institute of Information and Commucation Engineering)
권호 표지
DOI QR코드

DOI QR Code

Maximum Terminal Interconnection by a Given Length using Rectilinear Edge

  • Kim, Minkwon (School of Computer Science and Information Engineering, the Catholic University of Korea) ;
  • Kim, Yeonsoo (School of Computer Science and Information Engineering, the Catholic University of Korea) ;
  • Kim, Hanna (School of Computer Science and Information Engineering, the Catholic University of Korea) ;
  • Hwang, Byungyeon (School of Computer Science and Information Engineering, the Catholic University of Korea)
  • 투고 : 2021.04.01
  • 심사 : 2021.06.02
  • 발행 : 2021.06.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

This paper proposes a method to find an optimal T' with the most terminal of the subset of T' trees that can be connected by a given length by improving a memetic genetic algorithm within several constraints, when the set of terminal T is given to the Euclidean plane R2. Constraint (1) is that a given length cannot connect all terminals of T, and (2) considers only the rectilinear layout of the edge connecting each terminal. The construction of interconnections has been used in various design-related areas, from network to architecture. Among these areas, there are cases where only the rectilinear layout is considered, such as wiring paths in the computer network and VLSI design, network design, and circuit connection length estimation in standard cell deployment. Therefore, the heuristics proposed in this paper are expected to provide various cost savings in the rectilinear layout.

키워드

과제정보

This work was supported by the Catholic University of Korea, Research Fund (2019).

참고문헌

  1. K. Zhou and J. Chen, "Simulation DNA algorithm of set covering problem," Applied Mathematics & Information Sciences, vol. 8, no. 1, pp. 139-144, Jan. 2014. DOI: 10.12785/amis/080117.
  2. D. Hu, P. Dai, K. Zhou, and S. Ge, "Improved particle swarm optimization for minimum spanning tree of length constraint problem," in Proceeding of International Conference on Intelligent Computation Technology and Automation, Nanchang, pp. 474-477, 2015. DOI: 10.1109/icicta.2015.124.
  3. J. Kim, J. Oh, M. Kim, Y. Kim, J. Lee, S. Han, and B. Hwang, "Maximum node interconnection by a given sum of Euclidean edge lengths," Journal of information and communication convergence engineering, vol. 17, no. 4, pp. 246-254, 2019. DOI: 10.6109/jicce.2019.17.4.246.
  4. C. N. Chu and Y. C. Wong, "FLUTE: Fast lookup table based rectilinear Steiner minimal tree algorithm for VLSI design," IEEE Trans. Computer-Aided Design Integrated Circuits Syst., vol. 27, no. 1, pp. 70-83, Jan. 2008. DOI: 10.1109/TCAD.2007.907068.
  5. X. Cheng and D. Du, Steiner trees in industry, Kluwer Academic Publishers, 2013.
  6. G. Wei and X. Xie, "Research of using genetic algorithm of improvement to compute the most short path," in Proceeding of International Conference on Anti-counterfeiting, Security, and Identification in Communication, Hong Kong, pp. 516-519, 2009. DOI: 10.1109/ICASID.2009.5276990.
  7. E. N. Gilbert and H. O. Pollak, "Steiner minimal trees." SIAM J. of Appl. Math., vol. 16. no. 1, pp. 1-29, 1968. DOI: 10.1137/0116001.
  8. M. Garey and D. S. Johnson, "The rectilinear Steiner tree Problem is NP complete," SIAM Journal of Applied Mathematics, vol. 32, no. 4, pp. 826-834, 1977. DOI: 10.1137/0132071.
  9. M. Hanan, "On Steiner's problem with rectilinear distance," SIAM Journal of Applied Mathematics, vol. 14, no. 2, pp. 255-265, 1966. DOI: 10.1137/0114025.
  10. R. L. Graham, "An efficient algorithm for determining the convex hull of a finite planar set," Information Processing Letter, vol. 1, no. 4, pp. 132-133, 1972. DOI: 10.1016/0020-0190(72)90045-2.
  11. F. K. Hwang, "On Steiner minimal trees with rectilinear distance," SIAM Journal of Applied Mathematics, vol. 30, no. 1, pp. 104-114, 1976. DOI: 10.1137/0130013.