Nth-order current transfer function synthesis using DVCCs: signal-flow graph approach

2013 ◽  
Vol 100 (4) ◽  
pp. 482-496 ◽  
Author(s):  
Jinguang Jiang ◽  
Xifeng Zhou ◽  
Weilin Xu
Keyword(s):  
Transfer Function ◽  
Current Transfer ◽  
Signal Flow Graph ◽  
Flow Graph ◽  
Signal Flow

THE ANALYSIS OF PHASE, DISPERSION AND GROUP DELAY IN INGAASP/INP MICRORING RESONATOR

2016 ◽  
Vol 78 (3) ◽  
Author(s):  
IS Amiri ◽  
SE Alavi ◽  
ASM Supa'at ◽  
J. Ali ◽  
H Ahmad
Keyword(s):  
Transfer Function ◽  
Group Delay ◽  
Function Analysis ◽  
Microring Resonator ◽  
Optical Transfer Function ◽  
Signal Flow Graph ◽  
Flow Graph ◽  
Signal Flow ◽  
Phase Dispersion ◽  
Transfer Function Analysis

The Vernier operation with signal flow graph (SFG) is a graphical approach for analyzing the intricate photonic circuits mathematically and quick calculation of optical transfer function. Analysis of a cascaded microring resonators (CMRR) made of InGaAsP/InP semiconductor is presented using the signal flow graph (SFG) method which enables modelling the transfer function of the passive CMRR. These passive filters are mostly characterized by their frequency response. The theoretical calculations of the system is performed by the Vernier effects analysis. Two MRRs with radius of 100 µm which are vertically coupled together are used to generate resonant peaks. Here, the phase, dispersion and group delay of the generated signals are analyzed. 

Direct Application of the Loop Rule to Bond Graphs

1972 ◽  
Vol 94 (3) ◽  
pp. 253-261 ◽  
Author(s):  
F. T. Brown
Keyword(s):  
Transfer Function ◽  
Direct Reduction ◽  
Direct Application ◽  
Constant Parameter ◽  
Signal Flow Graph ◽  
Bond Graphs ◽  
Flow Graph ◽  
Signal Flow ◽  
Signal Flow Graphs ◽  
Flow Graphs

The Shannon-Mason loop rule permits direct reduction of a linear constant-parameter signal flow graph to a transfer function. Signal flow graphs can be constructed from bond graphs or sets of equations. Application of the loop rule to the parent bond graphs, however, with the aid of certain rules, is shown to be quicker and less prone to error. Also, four invariant classes of bond graph meshes are distinguished, with implications in physical analogies and in computation.

Sign in / Sign up

Export Citation Format

Share Document