Application of the Fault Tolerance of Reduced Bond Graph Approach of Parallel Computing of a Matching Network
Shiv Kumar Gupta1, Rajiv Kumar2, Krishna Kumar Verma3
1Gurpreet Kaur, Department of Electronics and Communication Engineering( Mtech Scholar), Kurukshetra University, jmit Radaur, Haryana, India.
2Devesh Mahor, Assistant Prof., Department of Electronics and Communication Engineering , MMU Mullana, Haryana , India.
3Anil Kamboj, Assistant Prof., Department of Electronics and Communication Engineering, jmit Radaur, Haryana, India.
Manuscript received on April 11, 2012. | Revised Manuscript received on April 14, 2012. | Manuscript published on May 05, 2012. | PP: 359-365 | Volume-2 Issue-2, May 2012 . | Retrieval Number: B0617042212/2012©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In this paper we present a new method for modeling high frequency systems. This method combines the scattering formalism with the bond graph model in a new technique called scattering bond graph model. This method allows describing explicitly the distribution of electromagnetic waves of any high frequency system. We applied this method to deduce the reflection and transmission coefficient as function as frequency of a parallel computing matching network of a Planar Inverted F Antenna.
Keywords: Matching network, scattering matrix, scattering formalism, bond graph modeling, scattering bond Graph model, PIFA.