Solving switched capacitors circuits by full graph methods

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F71226401%3A_____%2F11%3A%230000121" target="_blank" >RIV/71226401:_____/11:#0000121 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Solving switched capacitors circuits by full graph methods

Popis výsledku v původním jazyce

Circuits with switched capacitors are described by a capacitance matrix and seeking voltage transfers then means calculating the ratio of algebraic supplements of this matrix. As there are also graph methods of circuit analysis in addition to algebraic methods, it is clearly possible in theory to carry out an analysis of the whole switched circuit in two-phase switching exclusively by the graph method as well. For this purpose it is possible to plot a Mason graph of a circuit, use transformation graphsto reduce Mason graphs for all the four phases of switching, and then plot a summary graph from the transformed graphs obtained this way. First we draw nodes and possible branches, obtained by transformation graphs for transfers of EE (even-even) and OO(odd-odd) phases. In the next step, branches obtained by transformation graphs for EO and OE phase are drawn between these nodes, while their resulting transfer is multiplied by z-1/2 or z-1/2. This summary graph can then be interpreted b

Název v anglickém jazyce

Solving switched capacitors circuits by full graph methods

Popis výsledku anglicky

Circuits with switched capacitors are described by a capacitance matrix and seeking voltage transfers then means calculating the ratio of algebraic supplements of this matrix. As there are also graph methods of circuit analysis in addition to algebraic methods, it is clearly possible in theory to carry out an analysis of the whole switched circuit in two-phase switching exclusively by the graph method as well. For this purpose it is possible to plot a Mason graph of a circuit, use transformation graphsto reduce Mason graphs for all the four phases of switching, and then plot a summary graph from the transformed graphs obtained this way. First we draw nodes and possible branches, obtained by transformation graphs for transfers of EE (even-even) and OO(odd-odd) phases. In the next step, branches obtained by transformation graphs for EO and OE phase are drawn between these nodes, while their resulting transfer is multiplied by z-1/2 or z-1/2. This summary graph can then be interpreted b

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

20201 - Electrical and electronic engineering

Projekt

—

Návaznosti

V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Rok uplatnění

2011

Kód důvěrnosti údajů

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

Název periodika

International Journal of Circuits, Systems and Signal Processing

ISSN

1998-4464

e-ISSN

—

Svazek periodika

5

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

8

Strana od-do

271-278

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-80053945823