# Research on the Fault Feature Extraction Method of Rotor Systems Based on GAW-PSO

Authors: Feng Miao; Rongzhen Zhao; Xianli Wang
Journal: Mathematical Problems in Engineering
 (2020)

---

## Abstract

In order to solve the problem of blind separation of signals from dynamic hybrid rotor systems, this paper proposed an improved adaptive inertial weight particle swarm optimization method based on genetic mechanism. The method takes the negative entropy of separated signal as the objective function and adaptively adjusts the inertia weight according to the difference of particle fitness, thus reducing the number of invalid iterations. At the same time, genetic hybridization mechanism was introduced to increase population diversity and facilitate the processing of dynamic mixed signals. The orthogonal matrix is expressed as a parameterized form, which can reduce the complexity of the algorithm. The simulation results showed that the performance of the proposed method is better than that of the traditional method for blind separation of dynamic hybrid analog mechanical signals. It can separate the actual dynamic rotor system signals and achieve the purpose of fault feature extraction.


---

## Body

## 1. Introduction

During the operation of rotating machinery, the vibration signals measured by using vibration sensors are often superimposed by the vibrations of multiple components. How to analyse, process, and identify these signals is extremely important to judge and diagnose the working state of rotating machinery. The direct analysis and processing of sensor signals is bound to cause great difficulties in mechanical condition monitoring and fault diagnosis [1–3].Various traditional modern signal processing methods, such as Fourier transform, short-time Fourier transform, and wavelet transform, have been widely used in vibration signal analysis, but the above analysis methods have obvious disadvantages to many kinds of mixed vibration signals on rotating machinery [2, 4]. Blind source separation technology can realize the separation of multialiasing signal, while it is not affected by the overlap of source signal time and spectrum and the output signal after separation will not lose the weak feature information in the source signal [4]. In [5], the blind separation algorithm, empirical modal decomposition, and wavelet packet transform are combined to process the mechanical multifault signal. Li et al. [6] obtained the judgment criteria through the subjective Bayesian derivation and these were applied to multisensor distributed detection fusion algorithm to solve the problem of uncertainty in mechanical signal detection. The literature [7] was proposed to apply the mean pattern decomposition and blind separation algorithm of the extreme domain to single-channel mechanical fault detection at the same time. The literature [8] used particle swarm algorithm combined with blind separation algorithm for mechanical fault diagnosis. However, the traditional blind separation method of rotor signal is processed under the condition where the source signal is stable and the mixed channel is static, and the observation signal is mixed in the stochastic time-varying channel when the actual fault signal is separated blindly. Therefore, it is more practical to solve the problem of blind separation of random dynamic mixed fault signals in nonstationary environment.In order to solve the problem of blind separation of stochastic dynamic mixed fault signal in the nonstationary environment, a method for blind separation of dynamic fault signal is proposed. On the basis of particle swarm optimization (PSO), the inertia weight is adjusted adaptively and optimized by genetic algorithm (GA). The inertia weight of the algorithm will adjust adaptively with the difference between the fitness before and after each particle iteration, eliminating the adverse effect of the particle inertia component on the next iteration, which can reduce the number of invalid iterations and accelerate the convergence speed. At the same time, the genetic hybridization mechanism is introduced to increase the population diversity, so that the particles are not easy to fall into the local optimum, which can effectively solve the instability problem of blind separation of random dynamic mixed rotor vibration signals. On this basis, the separation orthogonal matrix is represented in the form of parameterization, which can effectively reduce the complexity of the algorithm. The experimental results show that the algorithm can effectively separate the random dynamic mixed rotor vibration signals, estimate the source signals well in time and frequency domain, and have better separation effect than the traditional algorithm; the algorithm can also effectively separate the actual dynamic rotor fault signals and then can achieve the detection of rotor coupling fault.


## 2. Blind Source Separation Model

Blind source separation (BSS) refers to estimating the parameters of each transmitter and transmission channel only by observing the signals when the parameters of each input signal and transmission channel are unknown [9, 10]. The mixing process is expressed by mathematical formulas as follows:(1)xt=Ast+nt.In formula (1), xt=x1t,x2t,…,xMtT is a M-dimensional random observation vector with noise, A is a mixed matrix of unknown full rank M×N, st=s1t,s2t,…,sNtT is a N-dimensional source signal, and sit of each component in the source signal is assumed to be statistically independent, and it contains at most one Gaussian noise; otherwise, it cannot be separated; nt=n1t,n2t,…,nMtT is a M-dimensional noise signal:(2)yt=Wxt.The purpose of blind source separation is to find a separation matrixW, so that yt=Wxt is the optimal estimate of st.Since blind source separation estimates the input signal only according to the observed signal, without any prior knowledge about the source signal, there are some uncertainties between the estimated input signal and the source signal, which are mainly reflected in the uncertainties in the estimation of the amplitude and order of the input signal. But these two uncertainties do not affect the analysis of the signal, because most of the information of the signal is contained in the waveform rather than in the magnitude and order [11, 12].


## 3. Adaptive Particle Swarm Algorithm for Improved Genetic Hybridization Mechanism

### 3.1. Particle Swarm Optimization

Particle swarm optimization (PSO) initializes the particle population and calculates the fitness value from the objective function to make the particle move to the optimal position [13, 14]. According to the motion state and fitness function of particles, the velocity and position of particles are updated iteratively, and the global optimal position is finally found. The velocity and position update formulas are as follows:(3)Vi,jt+1=Vi,jt+c1r1pi,j−Xi,jt+c2r2pg,j−Xi,jt,Xi,jt+1=Xi,jt+Vt+1,j=1,2,…,D.In formula (3),c1 and c2 are the learning factors, r1 and r2 are the random numbers distributed in [0, 1], D is the dimension of particle search space, Xi=Xi,1,Xi,2,…,Xi,D is the ith particle position, Vi=Vi,1,Vi,2,…,Vi,D is the ith particle velocity, Pi=pi,1,pi,2,…,pi,D is the optimal position of individual particle, and Pg=pg,1,pg,2,…,pg,D is the global optimal position of current population.Shi first applied the inertia weightω to the PSO algorithm. The inertia weight directly affects the update speed of particles and the convergence performance of the algorithm [12, 15]:(4)Vi,jt+1=ωtVi,jt+c1r1pi,j−Xi,jt+c2r2pg,j−Xi,jt.In formula (4), ω is the inertial weight. The inertial weight value can be adjusted to achieve an effective balance between particle search ability and convergence speed. Inertial weights can be reduced in the linear mode, that is, within [0.96, 0.5]. This makes the early inertial weight larger, have the good global search ability, and not easy to fall into the local optimal. Although the late inertial weight is small, it has the good local search ability and can accelerate the convergence:(5)ωt=ωmax−ωmax−ωmin×tN.In formula (5), ωt is the inertia weight at the t th iteration, N is the maximum iteration number, ωmax is the maximum inertia weight, and ωmin is the minimum inertia weight.


### 3.2. Genetic Algorithm Improved Adaptive Inertia Weight Particle Swarm Optimization

After each iteration, some of the particles will reach a better fitness position, while others will reach a suboptimal or worse position. In the next iteration, the particle with the best position will reach the better position after iteration, while the particle with the suboptimal or the worse position will reach the worse position after iteration. The particle with the best final position will approach or reach the global optimum position after many iterations, while the other particles will do the opposite. Therefore, when the particle is updated each time, the inertia weight of each particle can be dynamically adjusted according to the fitness value of the last iteration, which is very helpful to the global optimization and fast convergence of the particle population.According to the above discussion, PSO algorithm can be improved by adaptive inertia weight. Based on the difference of fitness before and after iteration, the whole particle swarm is divided into two parts, that is, the part with better fitness after iteration and the part with worse fitness. For those particles whose position is better, the inertia weight is set to the linear decreasing mode (formula (5)) to ensure that the population can converge quickly and optimize globally. For the other part of particles whose position is worse, the inertia weight is set to 0, which eliminates the adverse effects of inertia component on particle velocity and position updating [16, 17]:(6)δfXit=fXit−fXit−1.In formula (6), i=1,2,…,n, n is the number of particles; t≥2; fXit is the fitness value of the i particle in the t iteration; and δfXit is the difference between the fitness of the i particle in the t iteration and the t−1 iteration. In the current iteration, the dynamic adjustment values of inertia weights of each particle are expressed as follows:(7)ωit=wt,δfXit≥0,0,δfXit≤0.The adaptive inertia weight particle swarm optimization (AW-PSO) is obtained by substituting formula (7) into formula (4). The AW-PSO algorithm has good effect on blind separation of static signals and can quickly and accurately search for the global optimum. However, when applied to blind separation of dynamic fault mechanical signals, although the convergence speed is fast, it is difficult to find the global optimum of the population [18, 19]. Therefore, referring to the concept of genetic hybridization, this paper sets the proportion of hybridization Sp and chooses the corresponding particle population total M random pairwise hybridization, in which Sp∗M is the number of particles selected for hybridization. The updating formulas of position and velocity hybridization are as follows:(8)Xmct=pcXmt+1−pcXnt,Xnct=1−pcXmt+pcXnt.In formula (8), pc is the probability of genetic hybridization; in the tth iteration, the offspring particles Xmc and Xnc are obtained by the arithmetic hybridization of the parent particles Xm and Xn. The parent particle velocity can be obtained by the following formula:(9)Xmct=Vmt+VntVmt+VntVmt,Xnct=Vmt+VntVmt+VntVnt.After each iteration, the part of the particle population with better fitness is processed by formulas (8) and (9) to obtain new particle positions and velocities, which can increase the diversity of the population and better facilitate blind separation of dynamic signals. This is the genetic algorithm improved adaptive inertia weight particle swarm optimization (GAW-PSO).


## 3.1. Particle Swarm Optimization

Particle swarm optimization (PSO) initializes the particle population and calculates the fitness value from the objective function to make the particle move to the optimal position [13, 14]. According to the motion state and fitness function of particles, the velocity and position of particles are updated iteratively, and the global optimal position is finally found. The velocity and position update formulas are as follows:(3)Vi,jt+1=Vi,jt+c1r1pi,j−Xi,jt+c2r2pg,j−Xi,jt,Xi,jt+1=Xi,jt+Vt+1,j=1,2,…,D.In formula (3),c1 and c2 are the learning factors, r1 and r2 are the random numbers distributed in [0, 1], D is the dimension of particle search space, Xi=Xi,1,Xi,2,…,Xi,D is the ith particle position, Vi=Vi,1,Vi,2,…,Vi,D is the ith particle velocity, Pi=pi,1,pi,2,…,pi,D is the optimal position of individual particle, and Pg=pg,1,pg,2,…,pg,D is the global optimal position of current population.Shi first applied the inertia weightω to the PSO algorithm. The inertia weight directly affects the update speed of particles and the convergence performance of the algorithm [12, 15]:(4)Vi,jt+1=ωtVi,jt+c1r1pi,j−Xi,jt+c2r2pg,j−Xi,jt.In formula (4), ω is the inertial weight. The inertial weight value can be adjusted to achieve an effective balance between particle search ability and convergence speed. Inertial weights can be reduced in the linear mode, that is, within [0.96, 0.5]. This makes the early inertial weight larger, have the good global search ability, and not easy to fall into the local optimal. Although the late inertial weight is small, it has the good local search ability and can accelerate the convergence:(5)ωt=ωmax−ωmax−ωmin×tN.In formula (5), ωt is the inertia weight at the t th iteration, N is the maximum iteration number, ωmax is the maximum inertia weight, and ωmin is the minimum inertia weight.


## 3.2. Genetic Algorithm Improved Adaptive Inertia Weight Particle Swarm Optimization

After each iteration, some of the particles will reach a better fitness position, while others will reach a suboptimal or worse position. In the next iteration, the particle with the best position will reach the better position after iteration, while the particle with the suboptimal or the worse position will reach the worse position after iteration. The particle with the best final position will approach or reach the global optimum position after many iterations, while the other particles will do the opposite. Therefore, when the particle is updated each time, the inertia weight of each particle can be dynamically adjusted according to the fitness value of the last iteration, which is very helpful to the global optimization and fast convergence of the particle population.According to the above discussion, PSO algorithm can be improved by adaptive inertia weight. Based on the difference of fitness before and after iteration, the whole particle swarm is divided into two parts, that is, the part with better fitness after iteration and the part with worse fitness. For those particles whose position is better, the inertia weight is set to the linear decreasing mode (formula (5)) to ensure that the population can converge quickly and optimize globally. For the other part of particles whose position is worse, the inertia weight is set to 0, which eliminates the adverse effects of inertia component on particle velocity and position updating [16, 17]:(6)δfXit=fXit−fXit−1.In formula (6), i=1,2,…,n, n is the number of particles; t≥2; fXit is the fitness value of the i particle in the t iteration; and δfXit is the difference between the fitness of the i particle in the t iteration and the t−1 iteration. In the current iteration, the dynamic adjustment values of inertia weights of each particle are expressed as follows:(7)ωit=wt,δfXit≥0,0,δfXit≤0.The adaptive inertia weight particle swarm optimization (AW-PSO) is obtained by substituting formula (7) into formula (4). The AW-PSO algorithm has good effect on blind separation of static signals and can quickly and accurately search for the global optimum. However, when applied to blind separation of dynamic fault mechanical signals, although the convergence speed is fast, it is difficult to find the global optimum of the population [18, 19]. Therefore, referring to the concept of genetic hybridization, this paper sets the proportion of hybridization Sp and chooses the corresponding particle population total M random pairwise hybridization, in which Sp∗M is the number of particles selected for hybridization. The updating formulas of position and velocity hybridization are as follows:(8)Xmct=pcXmt+1−pcXnt,Xnct=1−pcXmt+pcXnt.In formula (8), pc is the probability of genetic hybridization; in the tth iteration, the offspring particles Xmc and Xnc are obtained by the arithmetic hybridization of the parent particles Xm and Xn. The parent particle velocity can be obtained by the following formula:(9)Xmct=Vmt+VntVmt+VntVmt,Xnct=Vmt+VntVmt+VntVnt.After each iteration, the part of the particle population with better fitness is processed by formulas (8) and (9) to obtain new particle positions and velocities, which can increase the diversity of the population and better facilitate blind separation of dynamic signals. This is the genetic algorithm improved adaptive inertia weight particle swarm optimization (GAW-PSO).


## 4. Blind Separation Algorithm Based on GAW-PSO

### 4.1. Objective Function

According to information theory, the entropy of Gauss variable is the largest among all equal variance random variables, so entropy can be used to measure non-Gauss. According to the central limit theorem, if a random variableX consists of the sum of many independent random variables Si, as long as Si has a finite mean and variance, then regardless of its distribution, the random variable X is closer to the Gaussian distribution than Si. In other words, Si is more non-Gaussian than X. Therefore, in the separation process, we can express the mutual independence of the separation results by the non-Gaussian measurement of the separation results. When the non-Gaussian measurement reaches the maximum, it indicates that the separation of the independent components has been completed [13].According to the central extremum theorem, the fitness function of the GAW-PSO is defined by using the negative entropy of separated signals. Negative entropy is used to measure the independence of each separated signal. When the negative entropy is maximum, the non-Gaussian property between separated signals is also the strongest [20]. When the probability distribution of the separated signal is symmetrical, the negative entropy of the first separated signal can be approximately expressed as(10)Jiyi≅148k42yi,where k4yi is the fourth-order cumulant of the i-way separated signal, namely kurtosis, which can be normalized and expressed as(11)k4yi=Eyi4Eyi22−3.In order to satisfy the constraints of zero mean andEyyT=I, centralization and prewhitening of the separated signal are needed before calculating the negative entropy. Therefore, the fitness function of the GAW-PSO algorithm is expressed as(12)fy=∑i=1n148k42yi.Under the constraint ofEyyT=I, if the fitness function becomes larger, the separation effect is better.


### 4.2. Parametric Representation of Orthogonal Matrix

According to the constraints on the separated signal in equation (12), the successful separation of yt can be guaranteed, as long as the separation matrix satisfies the orthogonal condition in the separation process. When dealing with n-order matrices, n2 unknowns need to be solved and the computational complexity is large. Because the degree of freedom of n-order orthogonal matrices is nn−1/2, the parameterized representation of N-order orthogonal matrices can significantly reduce the computational complexity. Through Cayley transformation, any N-order orthogonal matrix whose determinant is not equal to 1 can be transformed into the product form of rotation matrix. The orthogonal matrix is B2×2θ=cosθ.−sinθ;sinθ,cosθ, expressed by parameter vector θ=θ1,θ2,…,θnn−1/2, in which parameter vector θ∈0,2π.


### 4.3. Blind Separation Method Based on GAW-PSO

GAW-PSO algorithm uses particle position to represent the orthogonal separation matrix, which can reduce the dimensionD of particle search from n2 to nn−1/2 by parameterized representation, thus improving the efficiency of the algorithm. Furthermore, GAW-PSO algorithm adaptively chooses inertia weight to make the particle move to the global optimal position and introduces genetic hybridization mechanism to improve the diversity of the population, which can effectively blind separation dynamic signals. The specific steps are as follows:(1)
First, the observation dynamic mixed fault mechanical signalxt is sampled, and the centralization and prewhitening treatment are carried out.(2)
Particle population initialization randomly generates the separation matrix as the initial position of each particle and randomly initializes the velocity of each particle at the same time. The learning factorsc1 and c2, maximum inertia weight ωmax, and minimum inertia weight ωmin are initialized, respectively.(3)
yt can be calculated according to the sum of separation matrix (2), and then, the fitness values of each particle can be calculated by the sum of formulas (11) and (12).(4)
UpdatePi and Pg iteratively according to fitness value.(5)
Whent≥2, the inertia weight of each particle is adaptively adjusted by formulas (6) and (7).(6)
According to the probability of genetic hybridization, the corresponding number of particles is selected to produce the same number of offspring particles by random hybridization. The position and velocity of the offspring are determined by formulas (8) and (9).(7)
The inertia weights obtained in step 5 are substituted into formula (4), and the velocity and position of each particle are updated iteratively in step 6.(8)
Enter the loop state and output the result when the loop termination condition is reached; otherwise, return to step 3 to continue the search.


## 4.1. Objective Function

According to information theory, the entropy of Gauss variable is the largest among all equal variance random variables, so entropy can be used to measure non-Gauss. According to the central limit theorem, if a random variableX consists of the sum of many independent random variables Si, as long as Si has a finite mean and variance, then regardless of its distribution, the random variable X is closer to the Gaussian distribution than Si. In other words, Si is more non-Gaussian than X. Therefore, in the separation process, we can express the mutual independence of the separation results by the non-Gaussian measurement of the separation results. When the non-Gaussian measurement reaches the maximum, it indicates that the separation of the independent components has been completed [13].According to the central extremum theorem, the fitness function of the GAW-PSO is defined by using the negative entropy of separated signals. Negative entropy is used to measure the independence of each separated signal. When the negative entropy is maximum, the non-Gaussian property between separated signals is also the strongest [20]. When the probability distribution of the separated signal is symmetrical, the negative entropy of the first separated signal can be approximately expressed as(10)Jiyi≅148k42yi,where k4yi is the fourth-order cumulant of the i-way separated signal, namely kurtosis, which can be normalized and expressed as(11)k4yi=Eyi4Eyi22−3.In order to satisfy the constraints of zero mean andEyyT=I, centralization and prewhitening of the separated signal are needed before calculating the negative entropy. Therefore, the fitness function of the GAW-PSO algorithm is expressed as(12)fy=∑i=1n148k42yi.Under the constraint ofEyyT=I, if the fitness function becomes larger, the separation effect is better.


## 4.2. Parametric Representation of Orthogonal Matrix

According to the constraints on the separated signal in equation (12), the successful separation of yt can be guaranteed, as long as the separation matrix satisfies the orthogonal condition in the separation process. When dealing with n-order matrices, n2 unknowns need to be solved and the computational complexity is large. Because the degree of freedom of n-order orthogonal matrices is nn−1/2, the parameterized representation of N-order orthogonal matrices can significantly reduce the computational complexity. Through Cayley transformation, any N-order orthogonal matrix whose determinant is not equal to 1 can be transformed into the product form of rotation matrix. The orthogonal matrix is B2×2θ=cosθ.−sinθ;sinθ,cosθ, expressed by parameter vector θ=θ1,θ2,…,θnn−1/2, in which parameter vector θ∈0,2π.


## 4.3. Blind Separation Method Based on GAW-PSO

GAW-PSO algorithm uses particle position to represent the orthogonal separation matrix, which can reduce the dimensionD of particle search from n2 to nn−1/2 by parameterized representation, thus improving the efficiency of the algorithm. Furthermore, GAW-PSO algorithm adaptively chooses inertia weight to make the particle move to the global optimal position and introduces genetic hybridization mechanism to improve the diversity of the population, which can effectively blind separation dynamic signals. The specific steps are as follows:(1)
First, the observation dynamic mixed fault mechanical signalxt is sampled, and the centralization and prewhitening treatment are carried out.(2)
Particle population initialization randomly generates the separation matrix as the initial position of each particle and randomly initializes the velocity of each particle at the same time. The learning factorsc1 and c2, maximum inertia weight ωmax, and minimum inertia weight ωmin are initialized, respectively.(3)
yt can be calculated according to the sum of separation matrix (2), and then, the fitness values of each particle can be calculated by the sum of formulas (11) and (12).(4)
UpdatePi and Pg iteratively according to fitness value.(5)
Whent≥2, the inertia weight of each particle is adaptively adjusted by formulas (6) and (7).(6)
According to the probability of genetic hybridization, the corresponding number of particles is selected to produce the same number of offspring particles by random hybridization. The position and velocity of the offspring are determined by formulas (8) and (9).(7)
The inertia weights obtained in step 5 are substituted into formula (4), and the velocity and position of each particle are updated iteratively in step 6.(8)
Enter the loop state and output the result when the loop termination condition is reached; otherwise, return to step 3 to continue the search.


## 5. Simulation and Experimental Analysis

### 5.1. Evaluation Criteria

In order to effectively evaluate the effect of signal separation, the similarity coefficientξij is used as the evaluation index of the difference between the separated signal and the source signal [21, 22]. The similarity coefficient is defined as(13)ξij=ξyi,sj=∑t=1Myitsjt∑t=1Myi2t∑t=1Msj2t.If the similarity coefficient matrix has only one element close to 1 in each row and column and the other elements are close to 0, then the separation effect of the algorithm is ideal.


### 5.2. Simulations

In the event of friction, crack, and no medium fault in the rotor system, the signals collected by the sensor often appear as mixed fault signal and amplitude modulation signal. In the simulation test, four kinds of signals are selected, and the production function of the source signal is as follows:(14)st=s1ts2ts3ts4t=nt3sin0.4tcos10tsin3t+sin6t+sin10tsin2t.In equation (14), source signals1t simulates periodic vibration signal; s2t simulates misalignment fault characteristic signal; s3t simulates rubbing fault characteristic signal; and s4t simulates noise signal. The time-domain waveform of s1t,s2t,s3t,s4t is shown in Figure 1. The source signal generates the observed signal x1t,x2t,x3t,andx4t by random mixing. The mixing mode is linear superposition. The time-domain waveform of the mixed signal is shown in Figure 2.Figure 1
The simulative signal.Figure 2
The mixture of simulative signal.In the simulation experiment, the particle swarm algorithm and the GAW-PSO algorithm are used to separate the mixed signals, and the separation signals are shown in Figures3 and 4, respectively.Figure 3
The separated signal using PSO.Figure 4
The separated signal using GAW-PSO.Compared with Figures3 and 4, it can be seen the source signals separated by the general particle swarm optimization algorithm cannot reflect the waveform information of the source signals; the source signals separated by the improved adaptive particle swarm optimization algorithm can well reflect the waveform information of the source signals. Although the amplitude and sequence of the source signals and the separated signals are inconsistent, it does not affect the recognition of signal characteristics. The simulation experiment quantitatively evaluates the similarity of the improved adaptive particle swarm optimization algorithm to separate the signal from the source signal by using a correlation coefficient. The similarity coefficient matrix is as shown in Table 1.Table 1
Similarity coefficient and time of two algorithms.
PSO
GAW-PSO
ξ
0.1531
0.1026
0.0153
0.8962
¯
0.0302
0.2031
0.9536
¯
0.3047
0.1006
0.8975
¯
0.0081
0.3112
0.9563
¯
0.0309
0.2039
0.1154
0.0543
0.0192
0.0218
1.0000
¯
0.0218
0.0126
0.9998
¯
0.0611
0.0111
1.0000
¯
0.0013
0.0097
1.0000
¯
0.0010
0.0003
0.0003
t (s)
0.13
0.02The underline coefficient is expressed as the correlation coefficient between the separated signal and the source signal. From the similarity coefficient, it can be seen that the similarity coefficient between the separated signal and the source signal based on the improved particle swarm optimization algorithm is very high, which shows that the improved adaptive particle swarm optimization algorithm can accurately extract the characteristics of the source signal from the mixed signal.


### 5.3. Experiments

In order to verify the separation performance of the above algorithm for the measured vibration signals of the aliasing rotor, this paper analyses the vibration signals of the aliasing rotor. The rotor system and test bench are shown in Figure5. In the process of rotor rotation, there may be many potential source signals, such as bearing ball vibration signal, shaft axial vibration signal, and noise signal, and the sensor carries out measurements at the same time, so the signal measured by the sensor is a mixed vibration signal. In order to satisfy the hypothesis that the number of sensors in blind source separation (BSS) is greater than or equal to the number of source signals, the signals labeled 2, 3, 4, and 5 are used in the experiment. The rotating speed of the rotor is about 2800 r/min, and the sampling frequency is 5000 Hz. The measured four sensor signals are shown in Figure 6. The time-domain signals separated directly by the improved algorithm are shown in Figure 7. In order to compare the complex vibration of the rotor before and after separation more intuitively, the authors carried out the spectrum analysis of the data signals and observed the different characteristics of the signals from the frequency domain before and after separation. The spectra before and after separation are shown in Figures 8 and 9.Figure 5
Position of the sensor on the test bench.Figure 6
The vibration signal for rotor with multifaults.Figure 7
The separated signal using GAW-PSO.Figure 8
FFT of vibration signal for rotor with multifaults.Figure 9
FFT of the separated signal using GAW-PSO.In Figure8, because the characteristic frequency of the fault overlaps on each power spectrum, it is difficult to determine the existence of the fault type and make accurate fault diagnosis. Because the system is a rigid structure, the vibration delay can be ignored and the transient model can be maintained. Therefore, the GAW-POS method is used to separate the fault signal and obtain the separated signal. The power spectrum characteristics are shown in Figure 9.As can be seen from Figure9, in the separated signals, the power spectrum of each signal basically displays only one feature. The energy of the separated signal S1 is mainly concentrated on 50 Hz and 100 Hz, and the energy of other frequency components is very small, which is the characteristic of rotor unbalance fault. The frequency components of the separated signal S2 are concentrated on 50 Hz and 100 Hz, but the second frequency amplitude is larger than the fundamental frequency, which corresponds to the rub-impact fault characteristics of the rotor. The energy comparison method of S3 is dispersive, which corresponds to the characteristics of random noise. The energy of the separated signal S4 is mainly concentrated at 50 Hz, which corresponds to the power frequency of the rotor system.


## 5.1. Evaluation Criteria

In order to effectively evaluate the effect of signal separation, the similarity coefficientξij is used as the evaluation index of the difference between the separated signal and the source signal [21, 22]. The similarity coefficient is defined as(13)ξij=ξyi,sj=∑t=1Myitsjt∑t=1Myi2t∑t=1Msj2t.If the similarity coefficient matrix has only one element close to 1 in each row and column and the other elements are close to 0, then the separation effect of the algorithm is ideal.


## 5.2. Simulations

In the event of friction, crack, and no medium fault in the rotor system, the signals collected by the sensor often appear as mixed fault signal and amplitude modulation signal. In the simulation test, four kinds of signals are selected, and the production function of the source signal is as follows:(14)st=s1ts2ts3ts4t=nt3sin0.4tcos10tsin3t+sin6t+sin10tsin2t.In equation (14), source signals1t simulates periodic vibration signal; s2t simulates misalignment fault characteristic signal; s3t simulates rubbing fault characteristic signal; and s4t simulates noise signal. The time-domain waveform of s1t,s2t,s3t,s4t is shown in Figure 1. The source signal generates the observed signal x1t,x2t,x3t,andx4t by random mixing. The mixing mode is linear superposition. The time-domain waveform of the mixed signal is shown in Figure 2.Figure 1
The simulative signal.Figure 2
The mixture of simulative signal.In the simulation experiment, the particle swarm algorithm and the GAW-PSO algorithm are used to separate the mixed signals, and the separation signals are shown in Figures3 and 4, respectively.Figure 3
The separated signal using PSO.Figure 4
The separated signal using GAW-PSO.Compared with Figures3 and 4, it can be seen the source signals separated by the general particle swarm optimization algorithm cannot reflect the waveform information of the source signals; the source signals separated by the improved adaptive particle swarm optimization algorithm can well reflect the waveform information of the source signals. Although the amplitude and sequence of the source signals and the separated signals are inconsistent, it does not affect the recognition of signal characteristics. The simulation experiment quantitatively evaluates the similarity of the improved adaptive particle swarm optimization algorithm to separate the signal from the source signal by using a correlation coefficient. The similarity coefficient matrix is as shown in Table 1.Table 1
Similarity coefficient and time of two algorithms.
PSO
GAW-PSO
ξ
0.1531
0.1026
0.0153
0.8962
¯
0.0302
0.2031
0.9536
¯
0.3047
0.1006
0.8975
¯
0.0081
0.3112
0.9563
¯
0.0309
0.2039
0.1154
0.0543
0.0192
0.0218
1.0000
¯
0.0218
0.0126
0.9998
¯
0.0611
0.0111
1.0000
¯
0.0013
0.0097
1.0000
¯
0.0010
0.0003
0.0003
t (s)
0.13
0.02The underline coefficient is expressed as the correlation coefficient between the separated signal and the source signal. From the similarity coefficient, it can be seen that the similarity coefficient between the separated signal and the source signal based on the improved particle swarm optimization algorithm is very high, which shows that the improved adaptive particle swarm optimization algorithm can accurately extract the characteristics of the source signal from the mixed signal.


## 5.3. Experiments

In order to verify the separation performance of the above algorithm for the measured vibration signals of the aliasing rotor, this paper analyses the vibration signals of the aliasing rotor. The rotor system and test bench are shown in Figure5. In the process of rotor rotation, there may be many potential source signals, such as bearing ball vibration signal, shaft axial vibration signal, and noise signal, and the sensor carries out measurements at the same time, so the signal measured by the sensor is a mixed vibration signal. In order to satisfy the hypothesis that the number of sensors in blind source separation (BSS) is greater than or equal to the number of source signals, the signals labeled 2, 3, 4, and 5 are used in the experiment. The rotating speed of the rotor is about 2800 r/min, and the sampling frequency is 5000 Hz. The measured four sensor signals are shown in Figure 6. The time-domain signals separated directly by the improved algorithm are shown in Figure 7. In order to compare the complex vibration of the rotor before and after separation more intuitively, the authors carried out the spectrum analysis of the data signals and observed the different characteristics of the signals from the frequency domain before and after separation. The spectra before and after separation are shown in Figures 8 and 9.Figure 5
Position of the sensor on the test bench.Figure 6
The vibration signal for rotor with multifaults.Figure 7
The separated signal using GAW-PSO.Figure 8
FFT of vibration signal for rotor with multifaults.Figure 9
FFT of the separated signal using GAW-PSO.In Figure8, because the characteristic frequency of the fault overlaps on each power spectrum, it is difficult to determine the existence of the fault type and make accurate fault diagnosis. Because the system is a rigid structure, the vibration delay can be ignored and the transient model can be maintained. Therefore, the GAW-POS method is used to separate the fault signal and obtain the separated signal. The power spectrum characteristics are shown in Figure 9.As can be seen from Figure9, in the separated signals, the power spectrum of each signal basically displays only one feature. The energy of the separated signal S1 is mainly concentrated on 50 Hz and 100 Hz, and the energy of other frequency components is very small, which is the characteristic of rotor unbalance fault. The frequency components of the separated signal S2 are concentrated on 50 Hz and 100 Hz, but the second frequency amplitude is larger than the fundamental frequency, which corresponds to the rub-impact fault characteristics of the rotor. The energy comparison method of S3 is dispersive, which corresponds to the characteristics of random noise. The energy of the separated signal S4 is mainly concentrated at 50 Hz, which corresponds to the power frequency of the rotor system.


## 6. Conclusions

In the actual blind source separation of rotor system fault signals, the blind source separation problem of random and dynamic mixing is more practical. Aiming at this problem, this paper proposed a blind separation method based on GAW-PSO for fault signals of the dynamic rotor system. This method adaptively adjusts the inertia weight by the change of fitness value before and after each particle iteration, eliminates the adverse effect of inertia component on the next iteration, and effectively enhances the performance of the algorithm. At the same time, genetic algorithm hybridization mechanism is introduced to increase the diversity of the population, which makes the particles not easy to fall into local optimum, and effectively solves the problem of blind separation of bearing signals with stochastic and dynamic mixing. On this basis, the algorithm complexity can be effectively reduced by parameterizing the separated orthogonal matrix. The experimental results showed that the GAW-PSO algorithm can effectively separate the dynamic mixed analog rotor fault signals, and the separation performance is better than PSO algorithm. The method is applied to the blind separation of the actual rotor system fault dynamic signals, which further verifies the feasibility of the method and effectively detects the coupling fault of the rotor system.



---

*Source: 9296720-2020-03-09.xml*