As the complexities of automotive systems increase, designing a system is a difficult task that cannot be done manually. In this paper, we propose an algorithm for weight minimization of wires used for connecting electronic devices in a system. The wire routing problem is formulated as a Steiner tree problem with capacity constraints, and the location of a Steiner vertex is selected for adding a splice connecting more than two wires. Besides wire routing, wire sizing is also done to satisfy resistance constraints and minimize the total wiring weight. Experimental results show the effectiveness and efficiency of our algorithm. Copyright 2014 ACM
A set-partitioning problem for car wirings is addressed, in order to minimize the production costs. ...
This paper presents a new model for VLSI routing in the presence of obstacles, that transforms any r...
This paper presents an efficient and practical approach to the Constrained Via Minimization (CVM) pr...
As the complexities of automotive systems increase, designing a system is a difficult task that cann...
One of the key problems in VLSI interconnect design is the topology construction of signal nets with...
email martinzibberlinde email weismantelzibberlinde One of the challenging problems in the design ...
Placements of logical blocks in FPGA use many optimization algorithms in heuristic manner. Main obje...
We study the octilinear Steiner tree to evaluate the rectilinear Steiner tree based router. First, w...
We describe a practical iterative approximation algorithm that can be used for homotopic positioning...
Circuit interconnect has become a substantial obstacle in the design of high performance systems..4 ...
Abstract — This article describes an algorithm for curvilinear detailed routing. We significantly im...
In this paper, we consider non-uniform wire-sizing. Given a wire segment of length L, let f(x) be th...
Thesis: S.M., Massachusetts Institute of Technology, Sloan School of Management, Operations Research...
The weight of electric and electronic components of cars has been uninterruptedly increasing through...
In this paper, we study the simultaneous driver and wire sizing (SDWS) problem under two objective f...
A set-partitioning problem for car wirings is addressed, in order to minimize the production costs. ...
This paper presents a new model for VLSI routing in the presence of obstacles, that transforms any r...
This paper presents an efficient and practical approach to the Constrained Via Minimization (CVM) pr...
As the complexities of automotive systems increase, designing a system is a difficult task that cann...
One of the key problems in VLSI interconnect design is the topology construction of signal nets with...
email martinzibberlinde email weismantelzibberlinde One of the challenging problems in the design ...
Placements of logical blocks in FPGA use many optimization algorithms in heuristic manner. Main obje...
We study the octilinear Steiner tree to evaluate the rectilinear Steiner tree based router. First, w...
We describe a practical iterative approximation algorithm that can be used for homotopic positioning...
Circuit interconnect has become a substantial obstacle in the design of high performance systems..4 ...
Abstract — This article describes an algorithm for curvilinear detailed routing. We significantly im...
In this paper, we consider non-uniform wire-sizing. Given a wire segment of length L, let f(x) be th...
Thesis: S.M., Massachusetts Institute of Technology, Sloan School of Management, Operations Research...
The weight of electric and electronic components of cars has been uninterruptedly increasing through...
In this paper, we study the simultaneous driver and wire sizing (SDWS) problem under two objective f...
A set-partitioning problem for car wirings is addressed, in order to minimize the production costs. ...
This paper presents a new model for VLSI routing in the presence of obstacles, that transforms any r...
This paper presents an efficient and practical approach to the Constrained Via Minimization (CVM) pr...