X-architecture obstacles-avoiding routing with ECO consideration

  • Authors:
  • Jui-Hung Hung;Yao-Kai Yeh;Yu-Cheng Lin;Hsin-Hsiung Huang;Tsai-Ming Hsieh

  • Affiliations:
  • Dept. of Information and Computer Engineering, Chung Yuan Christian University, Chung-Li, Taiwan;Dept. of Information and Computer Engineering, Chung Yuan Christian University, Chung-Li, Taiwan;Dept. of Information and Electronic Commerce, Kainan University, Taoyuan, Taiwan;Dept. of Electronic Engineering, Lunghwa Univ. of Science and Technology, Taoyuan, Taiwan;Dept. of Information and Computer Engineering, Chung Yuan Christian University, Chung-Li, Taiwan

  • Venue:
  • ICC'10 Proceedings of the 14th WSEAS international conference on Circuits
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the paper, we formulate a novel obstacle-avoiding engineering change ordering (ECO) driven minimal tree construction problem. The objective is to build a better routing tree in the sense of increasing ECO flexibility to force the routing tree pass through regions in which more spare cells are available so that the additional total wirelength compared to a conventional wirelength oriented routing tree can be minimized. We incorporate the concept of inserting the virtual nodes which indicate sub-regions having more available spare cells by evaluating the distribution of spare cells. With the terminals, the corners of obstacles and the added virtual nodes, a routing tree is then constructed. Experimental results show that the number of available spare cells near the routing tree constructed by our algorithm is increased up to 65.82%, while only 2.08% of additional total wirelength.