Go home now Header Background Image
Search
Submission Procedure
share: |
 
Follow us
 
 
 
 
Volume 11 / Issue 6

available in:   PDF (121 kB) PS (229 kB)
 
get:  
Similar Docs BibTeX   Write a comment
  
get:  
Links into Future
 
DOI:   10.3217/jucs-011-06-0916

 

On Theoretical Upper Bound for Routing Estimation

Fei He (Dept. CS&T and School of Software, Tsinghua University, China)

Guowu Yang (Dept. ECE, Portland State University, USA)

Lerong Cheng (Dept. ECE, Portland State University, USA)

Xiaoyu Song (Dept. ECE, Portland State University, USA)

Ming Gu (School of Software, Tsinghua University, China)

Jiaguang Sun (School of Software, Tsinghua University, China)

Abstract: Routing space estimation plays a crucial role in design automation of digital systems. We investigate the problem of estimating upper bounds for global routing of two-terminal nets in two-dimensional arrays. We show the soundness of the bounds for both wiring space and total wire-length estimation.

Keywords: CAD, algorithms, global routing, integrated circuits

Categories: B.7.2, F.2.2