scholarly journals Mathematical Modelling of Twin -T Notch Filter using Floating Admittance Matrix

2022 ◽  
Vol 16 ◽  
pp. 88-93
Author(s):  
Sanjay Kumar Roy ◽  
Kamal Kumar Sharma ◽  
Brahmadeo Prasad Singh
Keyword(s):  
Mathematical Modelling ◽  
Transfer Functions ◽  
Notch Filter ◽  
Large Network ◽  
Electronic Circuits ◽  
Filter Function ◽  
Admittance Matrix ◽  
The Matrix ◽  
Time And Energy ◽  
Partitioning Technique

A novel article presents the RC-notch filter function using the floating admittance matrix approach. The main advantages of the approach underlined the easy implementation and effective computation. The proposed floating admittance matrix (FAM) method is unique, and the same can be used for all types of electronic circuits. This method takes advantage of the partitioning technique for a large network. The sum property of all the elements of any row or any column equal to zero provides the assurance to proceed further for analysis or re-observe the very first equation at the first instant itself. This saves time and energy. The FAM method presented here is so simple that anybody with slight knowledge of electronics but understating the matrix maneuvering can analyze any circuit to derive all types of transfer functions. The mathematical modelling using the FAM method allows the designer to adjust their design at any stage of analysis comfortably. These statements provide compelling reasons for the adoption of the proposed process and demonstrate its benefits.

scholarly journals Mathematical Modelling and Simulation of Band Pass Filters using the Floating Admittance Matrix Method

2021 ◽  
Vol 20 ◽  
pp. 208-214
Author(s):  
Sanjay Kumar Roy ◽  
Kamal Kumar Sharma ◽  
Cherry Bhargava ◽  
Brahmadeo Prasad Singh
Keyword(s):  
Mathematical Modeling ◽  
Matrix Method ◽  
Transfer Functions ◽  
Large Network ◽  
Admittance Matrix ◽  
The Matrix ◽  
Band Pass ◽  
Time And Energy ◽  
Mathematical Modelling And Simulation ◽  
Partitioning Technique

This article aims to develop a band pass filter's mathematical model using the Floating Admittance Matrix (FAM) method. The use of the conventional methods of analysis based KCL, KVL, Thevenin's, Norton's depends on the type of the particular circuit. The proposed mathematical modeling using the floating admittance matrix method is unique, and the same can be used for all types of circuits. This method uses the partitioning technique for large network. The sum property of all the elements of any row or any column equal to zero provides the assurance to proceed further for analysis or re-observe the very first equation. This saves time and energy. The FAM method presented here is so simple that anybody with slight knowledge of electronics but understating the matrix maneuvering, can analyze any circuit to derive all types of transfer functions. The mathematical modeling using the FAM method provides leverage to the designer to comfortably adjust their design at any stage of analysis. These statements provide compelling reasons for the adoption of the proposed process and demonstrate its benefits

scholarly journals Unique Analysis Approach to Bridge-T Network using Floating Admittance Matrix Method”

2021 ◽  
Vol 15 ◽  
pp. 1297-1304
Author(s):  
Sanjay Kumar Roy ◽  
Brahmadeo Prasad Singh ◽  
Kamal Kumar Sharma ◽  
Cherry Bhargava
Keyword(s):  
Mathematical Modeling ◽  
Tuning Range ◽  
Transfer Functions ◽  
Large Network ◽  
Wide Tuning Range ◽  
Admittance Matrix ◽  
The Matrix ◽  
Band Pass ◽  
Time And Energy ◽  
Network Form

The RC bridge-T Circuit are sometimes preferred for radio frequency applications as it does not require transformer (inductive coupling). The uses of the resistance-capacitance form of the network permits a wide tuning range. The article aims to develop a band pass filter's mathematical model using the Floating Admittance Matrix (FAM) approach. Both types of RC bridge-T network form the band-pass filters. The use of the conventional methods of analysis such as KCL, KVL, Thevenin's, Norton's depends on its suitability for the type of the particular circuit. The proposed mathematical modeling scheme using the floating admittance matrix approach is unique, and the same can be used for all types of circuits. This method is suitable to use the partitioning technique for large network. The sum property of all the elements of any row or any column equal to zero provides the assurance to proceed further for analysis or re-observe the very first equation. This saves time and energy. The FAM method presented here is so simple that anybody with slight knowledge of electronics but understating the matrix maneuvering, can analyze any circuit to derive all types of its transfer functions. The mathematical modeling using the FAM approach provides leverage to the designer to comfortably adjust their design at any stage of analysis. These statements provide compelling reasons for the adoption of the proposed process and demonstrate its benefits. The theoretically obtained equations meet the expected result for the RC bridge-T network. Its response peaks at the theoretically obtained value of the frequency. The simulated results are in agreement with the topological explanations and expectations.

Selecting optimal SpMV realizations for GPUs via machine learning

2021 ◽  
pp. 109434202199073
Author(s):  
Ernesto Dufrechou ◽  
Pablo Ezzatti ◽  
Enrique S Quintana-Ortí
Keyword(s):  
Machine Learning ◽  
Sparse Matrix ◽  
Machine Learning Techniques ◽  
Optimal Method ◽  
Learning Techniques ◽  
General Rules ◽  
Machine Learning Approach ◽  
The Matrix ◽  
Time And Energy ◽  
Matrix Vector

More than 10 years of research related to the development of efficient GPU routines for the sparse matrix-vector product (SpMV) have led to several realizations, each with its own strengths and weaknesses. In this work, we review some of the most relevant efforts on the subject, evaluate a few prominent routines that are publicly available using more than 3000 matrices from different applications, and apply machine learning techniques to anticipate which SpMV realization will perform best for each sparse matrix on a given parallel platform. Our numerical experiments confirm the methods offer such varied behaviors depending on the matrix structure that the identification of general rules to select the optimal method for a given matrix becomes extremely difficult, though some useful strategies (heuristics) can be defined. Using a machine learning approach, we show that it is possible to obtain unexpensive classifiers that predict the best method for a given sparse matrix with over 80% accuracy, demonstrating that this approach can deliver important reductions in both execution time and energy consumption.

scholarly journals EIGENVECTOR LOCALIZATION AS A TOOL TO STUDY SMALL COMMUNITIES IN ONLINE SOCIAL NETWORKS

2010 ◽  
Vol 13 (06) ◽  
pp. 699-723 ◽  
Author(s):  
FRANTIŠEK SLANINA ◽  
ZDENĚK KONOPÁSEK
Keyword(s):  
Online Social Networks ◽  
Large Network ◽  
Bipartite Networks ◽  
Small Communities ◽  
Complementary Approach ◽  
Matrix Encoding ◽  
The Matrix ◽  
Network Modules ◽  
Principal Tool ◽  
Eigenvector Localization

We present and discuss a mathematical procedure for identification of small "communities" or segments within large bipartite networks. The procedure is based on spectral analysis of the matrix encoding network structure. The principal tool here is localization of eigenvectors of the matrix, by means of which the relevant network segments become visible. We exemplified our approach by analyzing the data related to product reviewing on Amazon.com. We found several segments, a kind of hybrid communities of densely interlinked reviewers and products, which we were able to meaningfully interpret in terms of the type and thematic categorization of reviewed items. The method provides a complementary approach to other ways of community detection, typically aiming at identification of large network modules.

High-Q biquadratic notch filter synthesis using nodal admittance matrix expansion

2015 ◽  
Vol 69 (7) ◽  
pp. 981-987 ◽  
Author(s):  
Huu-Duy Tran ◽  
Hung-Yu Wang ◽  
Quoc-Minh Nguyen ◽  
Nan-Hui Chiang ◽  
Wei-Chun Lin ◽  
...  
Keyword(s):  
Notch Filter ◽  
High Q ◽  
Admittance Matrix ◽  
Filter Synthesis ◽  
Matrix Expansion ◽  
Nodal Admittance Matrix Expansion

Automated System of Stabilization and Position Control of Aviation Equipment

2019 ◽  
pp. 297-330
Author(s):  
Olha Sushchenko
Keyword(s):  
Position Control ◽  
Transfer Functions ◽  
Controller Design ◽  
Robust Stabilization ◽  
Automated System ◽  
Simulink Model ◽  
The Matrix ◽  
Stabilized Platform ◽  
And Control ◽  
The Mathematical Model

In this chapter, the author presents the problems of design of the robust automated system for stabilization and control of platforms with aircraft observation equipment. The mathematical model of the triaxial stabilized platform is developed. The procedure of synthesis of robust stabilization system based on robust structural synthesis is represented. The above-mentioned procedure uses loop-shaping approach and method of the mixed sensitivity. The matrix weighting transfer functions are obtained. The optimization programs in MatLab are developed. The developed procedures are approved based on the results of simulation by means of the appropriate Simulink model. The obtained results can be useful for unmanned aerial vehicles and aircraft of special aviation, which are used for monitoring technical objects and aerial photography. The technical contributions are procedures of the robust controller design represented as the flowchart. The proposed approach is validated by application of the theoretical suppositions to the concrete example and appropriate simulation results.

SPECTRAL PROPERTIES OF ADMITTANCE MATRICES OF RESISTIVE TREE NETWORKS

1994 ◽  
Vol 04 (01) ◽  
pp. 53-70
Author(s):  
I. CEDERBAUM
Keyword(s):  
Characteristic Frequency ◽  
Spectral Properties ◽  
Rational Functions ◽  
Resistive Network ◽  
Admittance Matrix ◽  
Sturm Sequences ◽  
Classical Work ◽  
Mechanical Analogue ◽  
The Matrix ◽  
General Tree

In this paper spectral properties of the admittance matrix of a resistive network whose underlying graph forms a general tree are studied. The algebraic presentation of the network is provided by its real node admittance matrix with respect to one of its terminal vertices, considered to be the root of the tree. The spectral properties of this matrix are studied by application of the theory of two-element-kind (R, C) networks. A mechanical analogue of a particular case of a similar problem, corresponding to a linear tree has been studied in the classical work of Gantmacher and Krein.7 Generalization of the study to networks based on trees of arbitrary structure calls for a modification of the mathematical approach. Instead of polynomial Sturm sequences applied in Ref. 7 the paper applies sequences of rational functions obeying the two basic Sturm conditions. In the special case of a linear tree these rational functions turn out to be polynomials, and the results are equivalent to those in Ref. 7. For a general tree the paper takes into consideration any root—leaf path of the tree. It is shown that the conditions on such a path are similar to those taking place on a linear tree. Some difference occurs in the number of sign reversals in the sequence of coordinates of characteristic vectors. In the case of a linear tree this number depends only on the position of the corresponding characteristic frequency in the spectrum of the matrix. In the case of a root-leaf path of a general tree, this number has to be normally decreased. The correction (which might be zero) is equal to the number of poles of the determinant of the reduced admittance matrix corresponding to the path considered, which does not exceed the characteristic frequency.

scholarly journals Novel Grounded Capacitor All-Pass and Notch Filters Using Current Conveyors and Differential Amplifier

2003 ◽  
Vol 26 (3) ◽  
pp. 167-170 ◽  
Author(s):  
R. Saraswat ◽  
K. Pal ◽  
S. Rana
Keyword(s):  
Input Impedance ◽  
Transfer Functions ◽  
Notch Filter ◽  
Second Order ◽  
Differential Amplifier ◽  
Current Conveyors ◽  
Output Impedance ◽  
High Input ◽  
Notch Filters ◽  
High Input Impedance

Three circuits each realizing second-order all-pass/notch filter transfer functions are reported. All circuits use grounded capacitors and are suitable for IC implementation. These circuits offer the advantages of high input impedance and low output impedance and are superior to all earlier realisations.

An Implementation of a Matrix Cache to Speed up the Conventional Transient Simulation of Piecewise Linear Circuits

1997 ◽  
Vol 07 (04) ◽  
pp. 353-360
Author(s):  
Ekachai Leelarasmee ◽  
Methee Hwangkhunnatham
Keyword(s):  
Linear Equation ◽  
Transient Analysis ◽  
Piecewise Linear ◽  
Management Technique ◽  
Power Electronic ◽  
Electronic Circuits ◽  
Power Electronic Circuits ◽  
The Matrix ◽  
Speed Up ◽  
Linear Circuits

A few techniques based on an efficient use of memory resources, called matrix caches, to speed up the transient analysis of piecewise linear circuits such as power electronic circuits are presented. These techniques use the fact that the matrix in the linear equation solving routines can only have a finite number of different values. Hence, by adding a cache memory management technique to store the LU factor of these matrices for future reuse, the linear equation solver can be performed much faster than that of a general purpose simulation program in which these LU factors have to be recomputed every time. Since most of the CPU analysis time is spent in solving linear equations, these techniques can actually speed up the transient analysis of piecewise linear circuits significantly. An experimental circuit simulator has been developed to implement the matrix cache and tested with a few piecewise linear power electronic circuits. The results indicate a speed increase of 2–10 times as compared with its non-matrix cache version.

Sign in / Sign up

Export Citation Format

Share Document