Non-Hanan routing

Huibo Hou, Jiang Hu, Sachin S. Sapatnekar

Research output: Contribution to journalArticlepeer-review

23 Scopus citations

Abstract

This work presents a Steiner tree construction procedure, Maximum delay violation Elmore routing tree, to meet specified sink arrival time constraints. It is shown that the optimal tree requires the use of non-Hanan points. The procedure works in two phases: a minimum-delay Steiner Elmore routing tree is first constructed using a minor variant of the Steiner Elmore routing tree procedure, after which the tree is iteratively modified, using an efficient search method, to reduce its length. The search method exploits the piecewise concavity of the delay function to arrive at a solution efficiently. Experimental results show that this procedure works particularly well for technologies where the interconnect resistance dominates, and significant cost savings are shown to be generated.

Original languageEnglish (US)
Pages (from-to)436-444
Number of pages9
JournalIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
Volume46
Issue number3
StatePublished - Jan 1 1999

Fingerprint Dive into the research topics of 'Non-Hanan routing'. Together they form a unique fingerprint.

Cite this