Sciweavers

ASPDAC
2005
ACM

A Min-area Solution to Performance and RLC Crosstalk Driven Global Routing Problem

13 years 5 months ago
A Min-area Solution to Performance and RLC Crosstalk Driven Global Routing Problem
-- This paper presents a novel global routing algorithm, AT-PO-GR, to minimize the routing area under both congestion, timing, and RLC crosstalk constraints. The proposed algorithm is consisted of three key parts: (1) timing and congestion optimization; (2) crosstalk budgeting and estimation; and (3) crosstalk elimination and local refinement. Compared with the recent work introduced in [9] and [10], the proposed algorithm can achieve smaller routing area and fewer shields under the same design constraints, yet use less running time.
Tong Jing, Ling Zhang, Jinghong Liang, Jingyu Xu,
Added 13 Oct 2010
Updated 13 Oct 2010
Type Conference
Year 2005
Where ASPDAC
Authors Tong Jing, Ling Zhang, Jinghong Liang, Jingyu Xu, Xianlong Hong, Jinjun Xiong, Lei He
Comments (0)