z-logo
open-access-imgOpen Access
Implementation of VLSI interconnect design
Author(s) -
D. Sathyanarayanan,
Moustafa Mohamed
Publication year - 2018
Publication title -
international journal of advanced technology and engineering exploration
Language(s) - English
Resource type - Journals
eISSN - 2394-7454
pISSN - 2394-5443
DOI - 10.19101/ijatee.2018.542006
Subject(s) - very large scale integration , interconnection , computer architecture , computer science , embedded system , telecommunications
One of the key problems in VLSI interconnect design is the topology construction of signal nets with the minimum cost. The Steiner tree problem is to find the tree structure which connects all pins of the signal net such that the wire length (i.e., cost) can be minimized. If all edges of the tree are restricted to the horizontal and vertical directions as are the case in VLSI design, the problem is called rectilinear Steiner tree (RST).The problem of optimizing interconnections between microelectronic devices is an evolving area under VLSI architectures. Steiner tree is a fundamental problem in the automatic inter-connects optimization for VLSI design. Existing methodologies using a Steiner tree approach are not optimal in terms of path length.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom