Title :
An exact algorithm for practical routing problems
Author :
Iizuka, Tetsuya ; Asada, Kunihiro
Author_Institution :
Dept. of Electron. Eng., Univ. of Tokyo, Japan
Abstract :
In this paper, we propose an exact algorithm for practical routing problems in automated cell generation. We assume grid-based, Manhattan two layer model. Experimental results show that the proposed method can generate better solutions than commercial tools with respect to the wire length and the number of vias. Our algorithm takes account of the characteristics of VLSI layouts, such as silicides and VDD/GND lines. This enables us to generate all possible routing patterns for real cell layouts. Our method generates all possible routing patterns under some restrictions, so we can pick up optimal patterns by various cost metrics.
Keywords :
VLSI; cellular arrays; circuit layout CAD; circuit optimisation; network routing; system-on-chip; SoC; VLSI; automated cell generation; cell-based ASIC; cost metrics; grid-based Manhattan two layer model; optimal patterns; routing patterns; routing problems; via number; wire length; Application specific integrated circuits; Cost function; Design methodology; Mesh generation; Routing; Silicides; Terminology; Very large scale integration;
Conference_Titel :
ASIC, 2002. Proceedings. 2002 IEEE Asia-Pacific Conference on
Print_ISBN :
0-7803-7363-4
DOI :
10.1109/APASIC.2002.1031602
