Efficient Wire Routing and Wire Sizing for Weight Minimization of Automotive Systems
Chung-Wei Lin, Lei Rao, Paolo Giusto, D'Ambrosio Joseph, Alberto Sangiovanni-Vincentelli

Citation
Chung-Wei Lin, Lei Rao, Paolo Giusto, D'Ambrosio Joseph, Alberto Sangiovanni-Vincentelli. "Efficient Wire Routing and Wire Sizing for Weight Minimization of Automotive Systems". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD), pp. 1730-1741, June 2015.

Abstract
As the complexities of automotive systems increase, designing a system is a difficult task that cannot be done manually. In this paper, we focus on wire routing and wire sizing for weight minimization to deal with more and more connections between devices in automotive systems. The wire routing problem is formulated as a minimal Steiner tree problem with capacity constraints, and the location of a Steiner vertex is selected to add a splice which is used to connect more than two wires. We modify the KMB algorithm [12] to efficiently construct Steiner trees and propose an Integer Linear Programming (ILP) formulation to relocate Steiner vertices and satisfy capacity constraints. The ILP formulation is relaxed to a Linear Programming (LP) formulation which has the same optimal objective and can be solved more efficiently. Besides wire routing, wire sizing is also performed to satisfy resistance constraints and minimize the total wiring weight. To the best of our knowledge, this is the first work in the literature to formulate the automotive routing problem as a minimal Steiner tree problem with capacity constraints and perform wire routing and wire sizing for weight minimization. An industrial case study shows the effectiveness and efficiency of our algorithm which provides an efficient, flexible, and scalable approach for the design optimization of automotive systems.

Electronic downloads

Internal. This publication has been marked by the author for TerraSwarm-only distribution, so electronic downloads are not available without logging in.

Citation formats

• HTML

  Chung-Wei Lin, Lei Rao, Paolo Giusto, D'Ambrosio Joseph,
  Alberto Sangiovanni-Vincentelli. <a
  href="http://www.terraswarm.org/pubs/581.html"
  >Efficient Wire Routing and Wire Sizing for Weight
  Minimization of Automotive Systems</a>, <i>IEEE
  Transactions on Computer-Aided Design of Integrated Circuits
  and Systems (TCAD)</i>, pp. 1730-1741, June 2015.

• Plain text

  Chung-Wei Lin, Lei Rao, Paolo Giusto, D'Ambrosio Joseph,
  Alberto Sangiovanni-Vincentelli. "Efficient Wire
  Routing and Wire Sizing for Weight Minimization of
  Automotive Systems". <i>IEEE Transactions on
  Computer-Aided Design of Integrated Circuits and Systems
  (TCAD)</i>, pp. 1730-1741, June 2015.

• BibTeX

  @article{LinRaoGiustoJosephSangiovanniVincentelli15_EfficientWireRoutingWireSizingForWeightMinimizationOf,
      author = {Chung-Wei Lin and Lei Rao and Paolo Giusto and
                D'Ambrosio Joseph and Alberto
                Sangiovanni-Vincentelli},
      title = {Efficient Wire Routing and Wire Sizing for Weight
                Minimization of Automotive Systems},
      journal = {IEEE Transactions on Computer-Aided Design of
                Integrated Circuits and Systems (TCAD)},
      pages = {1730-1741},
      month = {June},
      year = {2015},
      abstract = {As the complexities of automotive systems
                increase, designing a system is a difficult task
                that cannot be done manually. In this paper, we
                focus on wire routing and wire sizing for weight
                minimization to deal with more and more
                connections between devices in automotive systems.
                The wire routing problem is formulated as a
                minimal Steiner tree problem with capacity
                constraints, and the location of a Steiner vertex
                is selected to add a splice which is used to
                connect more than two wires. We modify the KMB
                algorithm [12] to efficiently construct Steiner
                trees and propose an Integer Linear Programming
                (ILP) formulation to relocate Steiner vertices and
                satisfy capacity constraints. The ILP formulation
                is relaxed to a Linear Programming (LP)
                formulation which has the same optimal objective
                and can be solved more efficiently. Besides wire
                routing, wire sizing is also performed to satisfy
                resistance constraints and minimize the total
                wiring weight. To the best of our knowledge, this
                is the first work in the literature to formulate
                the automotive routing problem as a minimal
                Steiner tree problem with capacity constraints and
                perform wire routing and wire sizing for weight
                minimization. An industrial case study shows the
                effectiveness and efficiency of our algorithm
                which provides an efficient, flexible, and
                scalable approach for the design optimization of
                automotive systems.},
      URL = {http://terraswarm.org/pubs/581.html}
  }
  

Posted by Barb Hoversten on 1 Jun 2015.
Groups: tools