{"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.