Speeding up VLSI Layout Verification Using Fuzzy Attributed Graphs Approach

2006 ◽  
Vol 14 (6) ◽  
pp. 728-737 ◽  
Author(s):  
Nian Zhang ◽  
Donald C. Wunsch II
1996 ◽  
Vol 36 (2) ◽  
pp. 156-172 ◽  
Author(s):  
Ky MacPherson ◽  
Prithviraj Banerjee

1992 ◽  
Vol 18 (1) ◽  
pp. 19-31
Author(s):  
F. Hashim ◽  
S.E.-D. Habib ◽  
M. Zaki

Author(s):  
Renchi Yang ◽  
Jieming Shi ◽  
Yin Yang ◽  
Keke Huang ◽  
Shiqi Zhang ◽  
...  

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):  
Michiroh Ohmura ◽  
Shin'Ichi Wakabayashi ◽  
Jun'Ichi Miyao ◽  
Noriyoshi Yoshida

Sign in / Sign up

Export Citation Format

Share Document