Minimum skew and minimum path length routing in VLSI layout design

Research output: Chapter in Book/Report/Conference proceedingChapter

20 Citations (Scopus)

Abstract

This paper presents a routing algorithm to accomplish the minimum skew as well as the minimum path length. For a net, this algorithm guarantees an equidistant routing for all the paths from the fan-out terminal to fan-in terminals of the net. In addition, the minimum path length routing is achieved for these paths among all the minimum skew routings. Since this algorithm allows each terminal to have a weight as a load, the skew for a net is still minimized even if terminals in the net have different loads. Moreover, a bottom-up routing method is proposed for circuits with a hierarchy. In this method, nets are routed first at the bottom of the logic hierarchy, and then routings are performed in higher levels of the hierarchy taking routing lengths in the lower levels into account. Owing to the bottom-up routing method, the proposed algorithm also guarantees skew minimization for circuits with a hierarchy.

Original languageEnglish
Title of host publicationNEC Research and Development
PublisherPubl by Nippon Electric Co
Pages569-575
Number of pages7
Volume32
Edition4
Publication statusPublished - 1991 Oct
Externally publishedYes

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Minimum skew and minimum path length routing in VLSI layout design'. Together they form a unique fingerprint.

  • Cite this

    Edahiro, M. (1991). Minimum skew and minimum path length routing in VLSI layout design. In NEC Research and Development (4 ed., Vol. 32, pp. 569-575). Publ by Nippon Electric Co.