Abstract:
In
today's VLSI designs, there can be many blockages in a routing
region. The obstacle-avoiding rectilinear Steiner minimum
tree (OARSMT) problem has become an important problem in
the physical design stage of VLSI circuits. This problem
has attracted a lot of attentions in research and several
approaches have been proposed to solve this problem effectively.
In this paper, we will present a maze routing based approach
to solve this OARSMT problem. Our approach can handle multi-pin
nets very well in both solution quality, running time and
memory space usage.
Biography:
Li
Liang obtained his B.Sc. from Nanjing University of Aeronautics
and Astronautics in 2007 and is currently an MPhil student
in the Department of Computer Science and Engineering of
CUHK. His research interests are algorithms of routing in
VLSI area.