Partition-based Routing Tree Algorithm with Obstacles

  title={Partition-based Routing Tree Algorithm with Obstacles},
  author={Hsin-Hsiung Huang and Yu-Cheng Lin and Hui-Yu Huang and Tsai-Ming Hsieh},
  journal={2007 International Symposium on Integrated Circuits},
In this paper, we propose a hybrid algorithm to obtain the routing tree with obstacles. The algorithm divides the chip into a set of sub-regions and applies the proper method for each sub-region. First, two density functions are used to determine the density of the sub-regions and judge whether the chip or sub-region should be divided. Then, the proper algorithm is selected to construct the routing tree of each sub-region. So far, we develop two different routing algorithms with the different… CONTINUE READING

Figures, Tables, and Topics from this paper.

Similar Papers

Loading similar papers…