A heuristic planar routing algorithm for high performance layouts

Research output: Contribution to journalArticlepeer-review


In this paper, a heuristic planar routing strategy for high performance single-layer layout is presented. The main goal of the approach is to optimize routing performance, i.e., maximize the routed Steiner-length with minimum overhead of routing lengths and number of bends. First, the Shape-Algorithm is introduced to determine the routing sequence for L-shaped nets. Then, the Flow-Algorithm, is applied based on a rubber-band equivalent (RBE) of the sketch to route the rest of the incomplete nets. The technique has been implemented and tried out for randomly generated data and examples. Simulation results show that the algorithm is highly efficient in high performance routing.

Original languageEnglish
Pages (from-to)143-158
Number of pages16
JournalJournal of the Chinese Institute of Electrical Engineering, Transactions of the Chinese Institute of Engineers, Series E/Chung KuoTien Chi Kung Chieng Hsueh K'an
Issue number2
Publication statusPublished - 2001 May 1

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A heuristic planar routing algorithm for high performance layouts'. Together they form a unique fingerprint.

Cite this