DocumentCode
1786725
Title
An efficient wire routing and wire sizing algorithm for weight minimization of automotive systems
Author
Chung-Wei Lin ; Lei Rao ; Giusto, Paolo ; D´Ambrosio, Joseph ; Sangiovanni-Vincentelli, A.
Author_Institution
EECS Dept., Univ. of California, Berkeley, Berkeley, CA, USA
fYear
2014
fDate
1-5 June 2014
Firstpage
1
Lastpage
6
Abstract
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.
Keywords
automotive electronics; network routing; trees (mathematics); wiring; Steiner tree problem; Steiner vertex; automotive systems; capacity constraints; electronic devices; resistance constraints; weight minimization; wire routing algorithm; wire sizing algorithm; wiring weight; Algorithm design and analysis; Automotive engineering; Resistance; Routing; Steiner trees; Wires; Wiring;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation Conference (DAC), 2014 51st ACM/EDAC/IEEE
Conference_Location
San Francisco, CA
Type
conf
DOI
10.1145/2593069.2593088
Filename
6881346
Link To Document