Diagnosis of Systems Via Wavelet Transform
Analysis Based on Time Frequency Representations
Saoni Banerji1, R.Senthil kumar2
1
Srm University/EEE,Chennai,India
Email: saonibanerji@ymail.com
2
Srm University/EEE,Chennai,India
Email: rrsvp@yahoo.co.in
Abstract— This paper represents the idea of condition
monitoring technique based on time-frequency classification of
technique which increases machine availability and machine
performance reducing consequential damage increasing machine
life reducing spare parts inventories and reducing breakdown
maintenance. This method is composed of two sequential
processes: 1.Efficient condition monitoring scheme capable of
proving warning and predicting faults at early stages. The
monitoring system obtains information from machines using
primary data and through use of modern signal processing
techniques. This is done via two sequential processes:1.Feature
extraction 2. Rule decision. Therefore in this paper signal
obtained from monitoring systems have been processed using
Wavelet transforms with suitable modified algorithms to extract
detailed information for induction motor fault diagnosis.
Diagnosis is done in two levels.first; it allows detection of bearing
faults, stator faults, rotor faults. Second, It refines the detection
by determination of severity degree of faults which are identified
on previous level. Results suggest that application of wavelet
transforms for processing and analysis of vibration signal to
different frequency regions in time domain based on time-
frequency representations improve the extraction of information
that can enhance the ability of system for diagnosis.
Index : feature extraction , rule decision, wavelet transforms,
condition monitoring , modified algorithms, time frequency
representations
I. Introduction
Two kinds of faults occur on induction motors: mechanical or
electrical ones.Condition monitoring and fault diagnosis of
induction motors are of great importance in production lines.
It can significantly reduce the cost of maintenance and the risk
of unexpected failures by allowing the early detection of
potentially catastrophic faults.. Besides, rotor faults can also
result in excess heat, decreased efficiency, reduced insulation
life, and iron core damage. So detection of mechanical and
electrical faults are equally important in any electrical motor.
The second one refines this detection by the determination of
severity degree of faults, which are already identified on the
previous level. The diagnosis is independent of the level of
load. This method is validated on a 5.5 kW induction motor
test bench.In this paper, we propose a diagnosis algorithm
based on the application of wavelet transforms for processing
and analysis of vibration signal to different frequency regions
in time domain based on time-frequency representations
which improve the extraction of informationof optimized
time–frequency representation (TFR) from a time–frequency
ambiguity plane. The goal is the realization of an accurate
diagnosis system of motor faults, such as bearing faults, stator
faults and broken bars.
II. FAULT DIAGNOSIS TECHNIQUES FOR INDUCTION
MOTORS
The fault diagnosis may be classified into two main parts:
(cause-effect and effect cause) the main methods used in the
fault diagnosis field are:
1. ANN artificial neural network better among many types of
fault diagnosis for stable, speed, parallel processing but of
some of its architecture cant apply for dynamic processing and
need a lot of data compared with to finite element method, the
solution time for calculating machine circuit parameters using
neural network model has been dramatically reduced, while
sufficient accuracy has been maintained. , as opposed to the
conventional techniques (expensive equipment, or accurate
mathematical models required) Fuzzy and neural network not
need it but just the data.
2. FFT the Fourier transforms is a representation of an image
as a sum of complex exponentials of varying magnitudes,
frequencies, and phases. The Fourier transform plays a critical
role in a broad range of image processing applications,
including enhancement, analysis, restoration, and
compression.
In this paper, we have proposed a new approach to implement
wavelet transform for the fault diagnosis of induction motors
III. WAVELET TRANSFORM IN FAULT ANALYSIS
Electrical signals obtained from the physical systems by
different types of transducers contain information about their
conditions. The advancement in signal processing techniques
and microprocessor technology has improved the extraction of
information. There are two approaches used for processing the
signal: time domain and frequency domain. In time domain
approach, the discrete time signal is directly analyzed by one
of the digital signal processing (DSP) techniques, and such as
filtering and averaging convolution, correlation, etc. In
frequency domain approach, the signal is first transformed to
the frequency domain using FT then, different methods of
analysis such as averaging, convolution, power spectrum, etc.
can be applied. Traditionally, STFT is used for the analysis of
non-stationary signals by windowing the signal with a shifted
window function . Since the same window function is used at
all the frequency range, the signal spectrum is presented with
same resolution over the entire time frequency plane. To
overcome the resolution limitation of STFT, variable width
window function needs to be used. WT is a mathematical
approach that decomposes a time domain signal into different
frequency groups and provides an alternative to STFT for
analyzing the non-stationary signals The basic difference
between WT and STFT is the basis function, where the STFT
uses only sine and cosine as basis functions; WT uses a wide
variety of functions specifying a certain mathematical
property. The essential condition to satisfy in case of WT is
that the basis functions must be located within the boundary of
Hilbert space . The analysis of signal can be achieved through
three distinct approaches: multiresolution, continuous wavelet
transform (CWT) and discrete wavelet transform (DWT).
IV . Diagnosis algorithm of faults
The optimal TFR method is applied to diagnose three kinds of
induction machine faults, which are the bearing fault, stator
fault and rotor fault shows the complete diagnosis algorithm
proposed. The goal of feature extraction is to generate a N-
point feature vector from the original 10,000-point current
signal. The feature vectors are classified with the Mahalanobis
distance.
The first step is to resample the signal. Knowing that the
characteristic frequencies of the three faults considered are
located near the fundamental frequency and, in order to
preserve relevant information, the original signal is resampled
with a downsampling rate of 25. Only the range of the
required frequencies is preserved. By downsampling, the
educed greatly. This leads to a great reduction of the
computation complexity. In addition, electrical noise has also
been attenuated. After this step, a new 200-point signal that
keeps the signature of the original signal is obtained. The
time–frequency ambiguity plane of the signal is calculated .
The ambiguity plane is a very important concept of our feature
extraction process. We will construct the TFR optimal for our
classification task by smoothing the ambiguity plane with a
class-dependent kernel. Here, the dimension of ambiguity
plane is 200×200. Basically we will directly select N points
from this plane as our feature vector.
V. Algorithm of the fast lifting WPT
On the base of the lifting WT, lifting scheme is also
performed at - high frequency band to construct the lifting
WPT which will hold almost all of advantages of lifting
WT.With the help of DSP, a fast lifting WPT can be
realized in favor of real-time system.Here, Daubechies D4
serves as wavelet basis to construct the algorithm of lifting
WPT which decomposes vibration signal by 3-order WPT.
The equivalent lifting scheme for Daub4 transform[41
is illustrated as figure 1.It is a little different from general
lifting scheme and some more complex in calculation ,but
it is much more effective in time-frequency resolutions
than general ones. Coefficients odd[n] W b
,the split step is performed at first.After odd
sequence (odd[n] ) and even sequence (even[n] ) are
processed by 4 steps: pre-update, predict, update and
normalize, a wavelet transform of lifting scheme is
completed.The functions of each steps is shown below:
1. Pre-Update:
for n=O to N-1
even[n] = even[n] +sqrt(3) *odd[n] (4)
2. Predict:
odd[O] = odd[O] -sqrt(3) *even[0]/4 -
(sqrt(3)-2) *even/iV-1]/4; (5)
(sqrt(3)-2) *even[n-1]/4 ; (6)
for n= 1 to N- 1
odd[n] = odd[n] -sqrt(3)*even[n]/4 -
3. Update:
for n=O to N-2
even[n] = even[n] - odd[n+l] ;
even/iV-1] = evenp-I] - odd[O] ;
4. Normalize:
for n=O to N- 1
even[n] = (sqrt(3)-l) *even[n]/sqrt(2) ;
odd[n] = (sqrt(3)-l) *odd[n]/ sqrt(2) ; (1)
According to above functions, the relations of
calculation are illustrated as figure 2 between odd and even
sequence in pre-update, predict and update steps.
VI .Calculation relations in lifting steps
As shown in figure 2,the equivalent lifting scheme for Daub4
transform cannot be directly applied in the lifting WPT.In
(5),the predict step of the 1st element in odd sequence is not
completed until the last one in even sequence is pre-
updated.And ,the update step of the last element in even
sequence still need the 1st one in odd sequence.This mode of
calculation is out of according with
the advantaged property of lifting WT and is very bad for the
fast lifting WPT.To correct it, even sequence in predict step
extend forward by one element(even[O] which is already pre-
updated) and odd sequence in update step extend backward by
one element(odd[n] which is already predicted).
VII .Modified calculation relations
Relevant functions is changed fast lifting
WPT. In fact transform of odd [n] is already completed
after predict step without regarding to normalize step.But mother wavelet, j,k[n] = 2j/2 (2jn − k) the mother wavelet at a
every contiguous elements(evenlj],evenlj+l],oddlj] and scale of S = 2j shifted by k, aj0,k the approximation coefficients
oddlj+ 11) is relevant during lifting calculation so that odd[n] at a scale of S = 2j0, dj,k the detail coefficients at a scale of
can not directly enter into next level transform until
S = 2j0, and N = 2J, being N the number of x[n] samples.
even[n- 11 is updated.Therefor their order of complete
transform is oddlj]-> eventi]-> oddlj+l]-> evenlj+l] and The scaling function could be defined as an aggregation of
need a little auxiliary memory to keep some middle-results wavelets at scales larger than 1. A discrete signal could be
of 1st-level and 2nd-level WPT which is more valuable for constructed by using a sum of J − j0 details and an
the powerful resolutions of WPT. approximation to 1 of a signal at a scale of S = 2j0.
According to this order, elements can be split into
another odd- and even-numbered samples to be decomposed
farther respectively in low and high frequency below:
odd[O] = odd[O] -( sqrt(3)-l) *even[0]/2;
evenm-I] = even/iV-l] - odd/iV-I] (2)
Coefficients .signal energy in each inner WP space can
serve as feature information. Signal energy E,, normalizd
is calculated below:
E3j,= abs( Coefj [i])*/E (3)
in (1 1)j denotes WP subplace from 0-7.Coef 91 is
Fig 2. Wavelet tree decomposition for three levels of detail.
WPT coefficients after de-n0ised.E is normalizing factor.
It is obvious that abs(Coef >fi])’/E can be also done
in-place . Feature information is extracted very fast because
most of coefficients is set to 0 after de-noised.Comparing
E3, with feature information of normal system.,it is easy to
diagnose in which frequency band fault has taken
place.Therefore the Algorithm of fast lifing WPT is proper
to real-time fault diagnosis system..Of course,the
realization of this scheme must recur to DSP’s power.

Fig.3 Frequency ranges for details and final approximation.

Taking a common wavelet family such as Daubechies mother
wavelet, an evolution is observed in the mother wavelet time
shape by just changing the Daubechies order as it is shown
.Yet, clear information for our purpose is really not received.
Fig.1

VIII. .Discrete wavelet transform (DWT) For low orders the power of one harmonic near the cut
The discrete version of the wavelet transform, DWT, consists frequency could be split in two different details..
in sampling the scaling and shifted parameters, but neither the
signal nor the transform. This leads to high-frequency
resolution at low frequencies and high-time resolution for
higher frequencies, with the same time and frequency
resolution for all frequencies.
A discrete signal x[n] could be decomposed as

(4)

where [n] is the scaling function, j0,k[n] = 2j0/2 (2j0 − k) the

scaling function at a scale of S = 2j0 shifted by k, [n] the
 cy cy

Non- No yes yes

stationa
ry

application Motor Motor Motor

operatio operatio operatio
n under n n
normal variable variable
operatio operatio operatio
ns ns ns
Fig 5..Low- and high-pass filter frequency response
corresponding to details.
Conclusions
shows an example of this drawback.The wavelet analysis is
WPD is proposed as a good method to detect any fault that
performed with a Daubechies db3 mother wavelet. The occurs in three phase induction motor such mixed eccentricity.
appearance of harmonic content due to 100 Hz superimposed In this paper, the treatment of raw data obtained from physical
machine parameters is presented. The obtained information
frequency appears on details 2 and 3; where it really should can be used as input to train the neural network for
appear only on detail 3 corresponding with the analysis band development of an intelligent diagnostic system. The results
of the investigation demonstrate the validity and usefulness of
between 125 and 62.5 Hz. A high-order Daubechies mother the WT. Different families of WTs have been introduced and
wavelet is needed in that case to prevent this drawback. This implemented with vibration signals covering the proposed
machine conditions.
drawback is due to db3 associated filter is not as ideal as it is
needed to be to filter the 100 Hz harmonic content on detail 2.

Fig 6. Test decomposition signal with overlapping effect.
TABLE 1: COMPARISION OF DIFFERENT TIME- FREQUENCY
REPRESENTATION TECHNIQUES
REFERENCES
[1]. Impact of Time-Frequency Representation to the Generalization
Ability of Synthesized Time-Frequency Spatial Patterns
Algorithm in Brain Computer InterfaceJun YAO, Member, Julius
PA. Dewald, Member, IEEE-2009
[2].Zhiqiang Guo, Jie Yang, “Wavelet transform image fusion based
on regional variance.,” Proc. SPIE, 2007, Vol.6790, 67902Y-1-
67902Y-6.-2008
[3].A Survey of Feature Extraction Approaches in Analog Circuit
Fault Diagnosis-2008 IEEE pacific-asia workshop on
Computational intelligence and industrial application
[4] A.K.S. Jardine, D. Lin and D. Banjevic, A review on machinery
diagnostics and prognostics implementing condition-based
maintenance, Mechanical Systems and Signal Processing 20 (2006),
pp. 1483–1510
[5] P. Simi, K.S. Valsan and Swarup, Wavelet based transformer
protection using high frequency power directional signals, Electric
Power Systems Research 78 (April (4)) (2008), pp. 547–558

ANALYSIS FFT STFT DWT

basis A priori A priori A priori

frequency Convolution Convolution Convolution

global global global

presentation Energy– Energy– Energy–

frequen time Time
cy frequen frequen
.