An Efficient Wire Routing And Wire Sizing Algorithm For Weight Minimization Of Automotive Systems

DAC '14: The 51st Annual Design Automation Conference 2014 San Francisco CA USA June, 2014(2014)

引用 13|浏览43
暂无评分
摘要
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.
更多
查看译文
关键词
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,
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要