Mathematical optimization and machine learning to support PCB topology identification

IF 0.6 Q4 ENGINEERING, ELECTRICAL & ELECTRONIC
Ilda Cahani, Marcus Stiemer
{"title":"Mathematical optimization and machine learning to support PCB topology identification","authors":"Ilda Cahani, Marcus Stiemer","doi":"10.5194/ars-21-25-2023","DOIUrl":null,"url":null,"abstract":"Abstract. In this paper, we study an identification problem for schematics with different concurring topologies. A framework is proposed, that is both supported by mathematical optimization and machine learning algorithms. Through the use of Python libraries, such as scikit-rf, which allows for the emulation of network analyzer measurements, and a physical microstrip line simulation on PCBs, data for training and testing the framework are provided. In addition to an individual treatment of the concurring topologies and subsequent comparison, a method is introduced to tackle the identification of the optimum topology directly via a standard optimization or machine learning setup: An encoder-decoder sequence is trained with schematics of different topologies, to generate a flattened representation of the rated graph representation of the considered schematics. Still containing the relevant topology information in encoded (i.e., flattened) form, the so obtained latent space representations of schematics can be used for standard optimization of machine learning processes. Using now the encoder to map schematics on latent variables or the decoder to reconstruct schematics from their latent space representation, various machine learning and optimization setups can be applied to treat the given identification task. The proposed framework is presented and validated for a small model problem comprising different circuit topologies.\n","PeriodicalId":45093,"journal":{"name":"Advances in Radio Science","volume":" 16","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Radio Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5194/ars-21-25-2023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 1

Abstract

Abstract. In this paper, we study an identification problem for schematics with different concurring topologies. A framework is proposed, that is both supported by mathematical optimization and machine learning algorithms. Through the use of Python libraries, such as scikit-rf, which allows for the emulation of network analyzer measurements, and a physical microstrip line simulation on PCBs, data for training and testing the framework are provided. In addition to an individual treatment of the concurring topologies and subsequent comparison, a method is introduced to tackle the identification of the optimum topology directly via a standard optimization or machine learning setup: An encoder-decoder sequence is trained with schematics of different topologies, to generate a flattened representation of the rated graph representation of the considered schematics. Still containing the relevant topology information in encoded (i.e., flattened) form, the so obtained latent space representations of schematics can be used for standard optimization of machine learning processes. Using now the encoder to map schematics on latent variables or the decoder to reconstruct schematics from their latent space representation, various machine learning and optimization setups can be applied to treat the given identification task. The proposed framework is presented and validated for a small model problem comprising different circuit topologies.
数学优化和机器学习支持 PCB 拓扑识别
摘要。本文研究了具有不同并发拓扑结构的原理图的识别问题。提出了一个由数学优化和机器学习算法支持的框架。通过使用Python库,如scikit-rf,它允许对网络分析仪的测量进行仿真,并在pcb上进行物理微带线仿真,为训练和测试框架提供了数据。除了对并发拓扑进行单独处理和随后的比较之外,还引入了一种方法,通过标准优化或机器学习设置直接解决最佳拓扑的识别问题:使用不同拓扑的原理图训练编码器-解码器序列,以生成所考虑的原理图的额定图表示的扁平表示。仍然包含编码(即扁平)形式的相关拓扑信息,因此获得的原理图的潜在空间表示可用于机器学习过程的标准优化。现在使用编码器将原理图映射到潜在变量上,或者使用解码器从潜在空间表示中重建原理图,各种机器学习和优化设置可以应用于处理给定的识别任务。针对一个包含不同电路拓扑结构的小模型问题,提出并验证了该框架。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Advances in Radio Science
Advances in Radio Science ENGINEERING, ELECTRICAL & ELECTRONIC-
CiteScore
0.90
自引率
0.00%
发文量
3
审稿时长
45 weeks
×
引用
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学术官方微信