How to Find Wave-Scattering Parameters from the Causal Bond Graph Model of a High Frequency Filter

Abstract

<b>Problem statement:</b> The aim of this study is to use the bond graph technique and the wave-scattering formalism, jointly, to determine the scattering matrix of a high frequency filter with cut-off frequency 10 GHz. <b>Approach:</b> The first step consist to model the high frequency filter by bond graph approach, afterward, we decomposed the obtained causal bond graph model under an elementary structures of a cascaded sub-model, where, each one containing only 0-junction (parallel admittance) and 1-junction (series impedance). The causal ways and algebraic loops present in each causal bond graph sub-model, allows us to derive the elementary wave matrix W⁽ⁱ⁾ of each sub-model. <b>Results:</b> The total or global wave matrix W^(T) of the high frequency filter is given by the product of all elementary wave matrixes W⁽ⁱ⁾. <b>Conclusion:</b> The scattering matrix S of the studied filter can be inferred by use of the founded wave matrix W^(T) which relates the incident and reflected waves at one port directly to the incident and reflected waves at the adjacent port and the relations linking the S coefficients to the W coefficients. Finally, the scattering parameters, founded from the wave matrix, will be checked by comparison of the simulation results

A Multi-Energetic Modeling Approach based on Bond Graph Applied to In-Wheel-Motor Drive System

“…The BG tool is based on energy transfer modeling contained in the physical systems. This exchange of energy is represented in graphical form [7].…”

A new modeling and simulation methodology of a patch antenna by bond graph approach

“…At the beginning we will start by introducing the principle of this new technique. This technique will, thereafter, apply to a patch antenna structure Bow Tie modified [3,4] techniques and our technique is based on the analytical procedure operating Scattering parameters [8,9,10].…”

Object Recognition Based on Image Segmentation and Clustering

“…Input: Superpixel image of n x n resolution (1): For each cluster C i For all C j adjacent to C i If (distance (C i , C j ) <threshold)) Then change values of C j to C i (2): End For Output: Display oversegmented image Graph formation: In graph based algorithms each superpixel is treated as a node in a graph and edge weight between two nodes are set proportional to the similarity between the two superpixels (Yu et al, 2002;Felzenszwalb and Huttenlocher, 2004).Let G=(V,E) be an undirected graph with vertices v i € V, represents a set of object parts and edges v i ,v j) € E, represents the similarities between the superpixels.Each edge (v i , v j ) € E, has a weight value dis((v i ,v j )) proportional to similarities between v i and v j and also it is non negative measure (Taghouti and Mami, 2010;Thilagamani and Shanthi, 2011a;2011b). The dissimilarity is calculated based on the color, motion,location,or some other attributes.…”