Finding the Sensitivity to Transfer Branch by Graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25530%2F20%3A39916259" target="_blank" >RIV/00216275:25530/20:39916259 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/NTSP49686.2020.9229527" target="_blank" >http://dx.doi.org/10.1109/NTSP49686.2020.9229527</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/NTSP49686.2020.9229527" target="_blank" >10.1109/NTSP49686.2020.9229527</a>

Result language
angličtina
Original language name
Finding the Sensitivity to Transfer Branch by Graphs
Original language description
The actual question in the area of circuit analysis and synthesis methods is the problem of sensitivity determination. The proposed approaches for sensitivity calculation are directed to the obtaining of a symbolic form and to avoiding the direct differentiation by using a signal-flow graph. Interesting results in this topic are based on Mason’s graphs, and Coates’ graphs. This paper presents the comparison of some methods to finding the sensitivity to transfer branch: previously published algebraic method and proposed SFG method.
Czech name
—
Czech description
—

Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
New Trends in Signal Processing, NTSP : proceedings
ISBN
978-1-72816-154-9
ISSN
1339-1445
e-ISSN
—
Number of pages
4
Pages from-to
43-46
Publisher name
IEEE (Institute of Electrical and Electronics Engineers)
Place of publication
New York
Event location
Demänovská dolina
Event date
Oct 14, 2020
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)