2007
DOI: 10.1016/j.aeue.2006.10.003
|View full text |Cite
|
Sign up to set email alerts
|

Haar wavelet method for the analysis of transistor circuits

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 18 publications
0
5
0
Order By: Relevance
“…In the wavelet analysis for a dynamic system, all functions need to be transformed into Haar series. As the differentiation of Haar wavelets always results in impulse functions which should be avoided, the integration of Haar wavelets is preferred, which should be expandable into Haar series with Haar coefficient matrix P . 0 t h ( m ) true( τ true) d τ P true( m × m true) boldh true( m true) ( t ) , t [ 0 , 1 ) , where the m ‐square matrix P is called the operational matrix of integration which satisfies the following recursive formula. P true( m × m true) = 1 2 m true[ 2 m P true( m 2 × m 2 true) H true( m 2 × m 2 true) H true( m 2 × m 2 true) 1 0 true( m 2 × m 2 true) true] , P true( 1 × 1 true) = 1 2 , where H true( m × m true) = Δ [ boldh true( m true) true( t 0 true) boldh true( m true) true( t 1...…”
Section: Some Properties Of Haar Waveletsmentioning
confidence: 99%
See 1 more Smart Citation
“…In the wavelet analysis for a dynamic system, all functions need to be transformed into Haar series. As the differentiation of Haar wavelets always results in impulse functions which should be avoided, the integration of Haar wavelets is preferred, which should be expandable into Haar series with Haar coefficient matrix P . 0 t h ( m ) true( τ true) d τ P true( m × m true) boldh true( m true) ( t ) , t [ 0 , 1 ) , where the m ‐square matrix P is called the operational matrix of integration which satisfies the following recursive formula. P true( m × m true) = 1 2 m true[ 2 m P true( m 2 × m 2 true) H true( m 2 × m 2 true) H true( m 2 × m 2 true) 1 0 true( m 2 × m 2 true) true] , P true( 1 × 1 true) = 1 2 , where H true( m × m true) = Δ [ boldh true( m true) true( t 0 true) boldh true( m true) true( t 1...…”
Section: Some Properties Of Haar Waveletsmentioning
confidence: 99%
“…In the wavelet analysis for a dynamic system, all functions need to be transformed into Haar series. As the differentiation of Haar wavelets always results in impulse functions which should be avoided, the integration of Haar wavelets is preferred, which should be expandable into Haar series with Haar coefficient matrix P [7][8][9][10][11][12][13][14][15][16][17][18].…”
Section: Integration Of Haar Waveletsmentioning
confidence: 99%
“…Maleknejad et al [22] suggested a rationalized Haar wavelet approach to solve a system of linear integro‐differential equations. Lepik [23] developed a segmentation method based on Haar wavelets for the solution of ODEs and PDEs, and subsequently the method has been shown to be an efficient tool for solving various kinds of linear and nonlinear problems [24, 25]. A Haar wavelet‐based method to analyze the design in the generalized state space singular system of transistor circuits was presented [26].…”
Section: Introductionmentioning
confidence: 99%
“…[14] applies Haar wavelet based method for the analysis of observer design in the generalized state space systems of transistor circuits. It is confirmed that Haar wavelet method is better than the Walsh function techniques.…”
Section: Introductionmentioning
confidence: 99%
“…(13) in single term Haar wavelet series with (14) we obtain the following set of recursive equations with …”
Section: Introductionmentioning
confidence: 99%