Design of Wire Routing for EMC

G. Capraro, C. Paul
{"title":"Design of Wire Routing for EMC","authors":"G. Capraro, C. Paul","doi":"10.1109/ISEMC.1979.7568825","DOIUrl":null,"url":null,"abstract":"A study of the feasibility of developing a wire routing algorithm to minimize wire-coupled interference is discussed. An optimal wire routing algorithm is presented which generates a wire bundle (harness) configuration that minimizes the wire-coupled interference and satisfies certain physical constraints such as allowable bundle segment paths. The wire coupling model and the compatibility criteria are also discussed. It is shown that the optimal wire routing problem can be reduced to an iterative tree building algorithm. Implementation of the algorithm for a digital computer is briefly discussed and an example is presented.","PeriodicalId":283257,"journal":{"name":"1979 IEEE International Symposium on Electromagnetic Compatibility","volume":"101 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1979-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1979 IEEE International Symposium on Electromagnetic Compatibility","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISEMC.1979.7568825","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

A study of the feasibility of developing a wire routing algorithm to minimize wire-coupled interference is discussed. An optimal wire routing algorithm is presented which generates a wire bundle (harness) configuration that minimizes the wire-coupled interference and satisfies certain physical constraints such as allowable bundle segment paths. The wire coupling model and the compatibility criteria are also discussed. It is shown that the optimal wire routing problem can be reduced to an iterative tree building algorithm. Implementation of the algorithm for a digital computer is briefly discussed and an example is presented.
电磁兼容布线设计
讨论了开发一种减小线耦合干扰的布线算法的可行性。提出了一种最优布线算法,该算法生成的线束(线束)结构能最大限度地减少线耦合干扰,并满足一定的物理约束,如线束段路径的允许。讨论了线耦合模型和兼容标准。结果表明,最优布线问题可以简化为迭代树构建算法。简要讨论了该算法在数字计算机上的实现,并给出了一个实例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信