Hierarchical detailed floorplanning with global routing in VLSI layout design

Author(s):  
Michiroh Ohmura ◽  
Shin'Ichi Wakabayashi ◽  
Jun'Ichi Miyao ◽  
Noriyoshi Yoshida
VLSI Design ◽  
1994 ◽  
Vol 1 (3) ◽  
pp. 233-242 ◽  
Author(s):  
Xiaoyu Song

Channel routing problem is an important, time consuming and difficult problem in VLSI layout design. In this paper, we consider the two-terminal channel routing problem in a new routing model, called knock-knee diagonal model, where the grid consists of right and left tracks displayed at +45° and –45°. An optimum algorithm is presented, which obtains d + 1 as an upper bound to the channel width, where d is the channel density.


Author(s):  
Hiroshi Izumoto ◽  
Shin'Ichi Wakabayashi ◽  
Jun'Ichi Miyao ◽  
Noriyoshi Yoshida

Integration ◽  
2005 ◽  
Vol 38 (3) ◽  
pp. 439-449 ◽  
Author(s):  
Yukiko Kubo ◽  
Hiroshi Miyashita ◽  
Yoji Kajitani ◽  
Kazuyuki Tateishi
Keyword(s):  

Author(s):  
Yusuke Morimoto ◽  
Mitsuru Matsushita ◽  
Michiaki Muraoka ◽  
Masahiko Toyonaga

Sign in / Sign up

Export Citation Format

Share Document