SCIENCE CHINA Information Sciences, Volume 60, Issue 1: 019102(2017) https://doi.org/10.1007/s11432-015-0850-4

MLXR: multi-layer obstacle-avoiding X-architecture Steiner tree construction for VLSI routing

More info
  • ReceivedOct 26, 2015
  • AcceptedDec 29, 2015
  • PublishedMay 16, 2016




This work was supported in part by National Basic Research Program of China (Grant No. 2011CB808000), National Natural Science Foundation of China (Grants Nos. 11271002, 11501114), Fujian Natural Science Funds for Distinguished Young Scholar (Grant No. 2014J06017), and Program for New Century Excellent Talents in Fujian Province (Grant No. JA13021).


[1] Lin C W, Chen S Y, Li C F, et al. Multilayer obstacle-avoiding rectilinear Steiner tree construction based on spanning graphs. IEEE Trans Comput-Aided Des Integr Circuits Syst, 2008, 27: 2007-2016 CrossRef Google Scholar

[2] Liu C H, Chen I C, Lee D T. An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction. In: Proceedings of the 49th Annual Design Automation Conference. New York: ACM, 2012. 613--622. Google Scholar

[3] Shen W X, Cai Y C, Hong X L, et al. A single layer zero skew clock routing in X architecture. Sci China Ser F-Inf Sci, 2009, 52: 1466-1475 CrossRef Google Scholar

[4] Huang X, Liu G, Guo W, et al. Obstacle-avoiding algorithm in X-architecture based on discrete particle swarm optimization for VLSI design. ACM Trans Des Autom Electron Syst, 2015, 20: 1-28 Google Scholar

[5] Ho T Y, Chang C F, Chang Y W, et al. Multilevel full-chip routing for the X-based architecture. In: Proceedings of the 42nd Annual Design Automation Conference. New York: ACM, 2005. 597--602. Google Scholar

[6] Liu G, Huang X, Guo W, et al. Multilayer obstacle-avoiding X-architecture Steiner minimal tree construction based on particle swarm optimization. IEEE Trans Syst Man Cybern B, 2015, 45: 989-1002 Google Scholar

[7] Lin Y C, Chien H A, Shih C C, et al. A multi-layer obstacles-avoiding router using X-architecture. WSEAS Trans Circuits Syst, 2008, 7: 879-888 Google Scholar

[8] Bentley J L, Friedman J H. Fast algorithm for constructing minimal spanning trees in coordinate spaces. IEEE Trans Comput, 1978, 100: 97-105 Google Scholar

Copyright 2020 Science China Press Co., Ltd. 《中国科学》杂志社有限责任公司 版权所有

京ICP备18024590号-1       京公网安备11010102003388号