Implementation of Graph-Based Symbolic Simplification

Z. Kolka, M. Vlk
{"title":"Implementation of Graph-Based Symbolic Simplification","authors":"Z. Kolka, M. Vlk","doi":"10.1109/RADIOELEK.2007.371426","DOIUrl":null,"url":null,"abstract":"This paper deals with implementation of a method of graph-based symbolic simplification. The method is based on the structural modification of voltage and current graphs representing a network. The proposed method goes beyond the capabilities of conventional approach consisting in eliminating the network parameters or coefficients of a circuit matrix. It changes the graph structure in order to decrease the number of common spanning trees. The result is a simplified circuit model that can be analyzed symbolically or it can be used as a macromodel. The important property is that the graph transformation is based on physical relations in the circuit in contrast to the purely mathematical methods.","PeriodicalId":446406,"journal":{"name":"2007 17th International Conference Radioelektronika","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 17th International Conference Radioelektronika","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RADIOELEK.2007.371426","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper deals with implementation of a method of graph-based symbolic simplification. The method is based on the structural modification of voltage and current graphs representing a network. The proposed method goes beyond the capabilities of conventional approach consisting in eliminating the network parameters or coefficients of a circuit matrix. It changes the graph structure in order to decrease the number of common spanning trees. The result is a simplified circuit model that can be analyzed symbolically or it can be used as a macromodel. The important property is that the graph transformation is based on physical relations in the circuit in contrast to the purely mathematical methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于图的符号简化的实现
本文讨论了一种基于图的符号化简方法的实现。该方法基于对表示网络的电压和电流图的结构修改。该方法超越了传统方法消除电路矩阵的网络参数或系数的能力。它通过改变图的结构来减少公共生成树的数量。其结果是一个简化的电路模型,可以进行符号化分析,也可以作为一个宏模型使用。重要的性质是图变换是基于电路中的物理关系,而不是纯粹的数学方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Through-Wall Propagation Measurements Comparison of Real-coding Genetic Algorithm with Particle Swarm Optimization on the bandgap bandwidth maximization problem Automated Workplace for Measurement of Directional Characteristics of Microphones Image Processing with Invertible Rapid Transform A Performance of Wireless Ad-Hoc Network Routing Protocol
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1