Abstract
In this thesis, we will study the construction ofa Steiner routing tree for a given net with theobjective of minimizing the delay of the routing tree.Previous researches adopt Elmore delay modelto compute delay.We also adopt the motivations to design the flow.However, with the advancement of IC technology, a more accurate delaymodel is required. Therefore, in this thesis,we will use two-pole delay model to compute the cost functionof a Steiner tree.Moreover, we propose a new algorithm to construct the Steiner tree.Our algorithm takes into consideration the net topology, the total wirelength and the longest path from the source to sink.Experimental results show that our algorithm is veryeffective and efficient as compared to [8].