Bottleneck Crosstalk Minimization in Three-Layer Channel Routing

2019 ◽  
pp. 79-98
Author(s):  
Tarak Nath Mandal ◽  
Kaushik Dey ◽  
Ankita Dutta Banik ◽  
Ranjan Mehera ◽  
Rajat Kumar Pal
Keyword(s):  
Channel Routing

Discretionary channel routing

1988 ◽  
Vol 135 (2) ◽  
pp. 45
Author(s):  
H.W. Leong ◽  
C.L. Liu
Keyword(s):  
Channel Routing

On the Three-Dimensional Channel Routing

2016 ◽  
Vol E99.A (10) ◽  
pp. 1813-1821
Author(s):  
Satoshi TAYU ◽  
Toshihiko TAKAHASHI ◽  
Eita KOBAYASHI ◽  
Shuichi UENO
Keyword(s):  
Three Dimensional ◽  
Channel Routing

scholarly journals An Optimum Channel Routing Algorithm in the Knock-knee Diagonal Model

VLSI Design ◽  
1994 ◽  
Vol 1 (3) ◽  
pp. 233-242 ◽  
Author(s):  
Xiaoyu Song
Keyword(s):  
Routing Algorithm ◽  
Difficult Problem ◽  
Layout Design ◽  
Channel Routing ◽  
Routing Problem ◽  
Vlsi Layout ◽  
Channel Density ◽  
Optimum Algorithm ◽  
Important Time ◽  
Optimum Channel

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.

scholarly journals Bubble-sort approach to channel routing

2000 ◽  
Vol 147 (6) ◽  
pp. 415 ◽  
Author(s):  
S.-S. Chen ◽  
C.-H. Yang ◽  
S.-J. Chen
Keyword(s):  
Channel Routing
Sign in / Sign up

Export Citation Format

Share Document