Research Article  Open Access
Song Wang, "Windowed Least Square Algorithm Based PMSM Parameters Estimation", Mathematical Problems in Engineering, vol. 2013, Article ID 131268, 11 pages, 2013. https://doi.org/10.1155/2013/131268
Windowed Least Square Algorithm Based PMSM Parameters Estimation
Abstract
Stator resistance and inductances in axis and axis of permanent magnet synchronous motors (PMSMs) are important parameters. Acquiring these accurate parameters is usually the fundamental part in driving and controlling system design, to guarantee the performance of driver and controller. In this paper, we adopt a novel windowed least algorithm (WLS) to estimate the parameters with fixed value or the parameter with time varying characteristic. The simulation results indicate that the WLS algorithm has a better performance in fixed parameters estimation and parameters with time varying characteristic identification than the recursive least square (RLS) and extended Kalman filter (EKF). It is suitable for engineering realization in embedded system due to its rapidity, less system resource possession, less computation, and flexibility to adjust the window size according to the practical applications.
1. Introduction
The highfieldstrength neodymiumironboron (NdFeB) magnets have become commercially available with affordable prices, so the permanent magnet synchronous motor (PMSM) is receiving increasing attention due to its high speed, high power density, and high efficiency. It is very suitable for some highperformance requirement applications, for example, robotics, aerospace, electric ship propulsion systems, and wind power generation systems [1–3]. It has been shown that PMSM can provide significant performance improvement in many variable speed applications [4]. The commonly used control method in motor control is vector control. The method has a requirement of obtaining related parameters of the motor. Therefore, acquiring accurate parameters of the motor is usually the fundamental part in driving system design. We cannot measure the motor parameters with normal noload test and locked rotor test in the work site. Moreover, with the increasing working time of the motor and the surrounding environment changes, some parameters of the motor will be changed. Therefore, servo drivers usually have the function of parameters identification and selftuning [3].
Stator resistance and inductances in axis and axis are important parameters of motor model, which are considered as constants usually. However, these parameters vary with different operation conditions when motor is running [5]. The study object of this paper was permanent magnet servomotor produced by Huada Company in Wuhan of China. The experiment data showed that stator resistance value ranged from to 1.3 and that inductance value ranged from to 1.004 when the temperature ranged from 20 degrees to 80 degrees. Thus, the temperature of motor had a great influence on stator resistance and inductance in axis and axis. When these parameters are treated as constants, the stability and control performance of the system will be affected. Therefore, the realization of parameters (, , and ) identification is essential for motion control of PMSM.
Model identification and parameter estimation techniques have become mature after years of development. From the least square estimation theory [6–14] and its various improved algorithm [15–23] to Kalman filter algorithm [24–27], neural network [28, 29], genetic algorithm [30–32], and so forth, they can serve as parameter estimation tools. However, these methods have their own characteristics and applicability.
The least square estimation is one of the most simple and most mature parameter estimation methods. However the amount of calculation of the traditional least square method will increase with time sequence increase. It is hard to realize in embedded chip due to the large amount of calculation, and there is a problem of data saturation. Kalman filtering algorithm is put forward for system identification by Kalman in 1960, and there is a wide range of use. However, it is sensitive to the initial conditions [26], and its performance is poor for time varying parameter identification [33, 34]. With the development of artificial intelligence technology, neural network [28, 29] and genetic algorithm [30–32] are used to the parameter estimation. These intelligent methods can get the identification results with high accuracy. However, it is hard to apply them in practical parameter estimation due to the large amount of calculation and complexity of the algorithm. Therefore, least square algorithm is also a commonly parameter estimation method. Kinds of improved algorithms are proposed to promote the identification performance of traditional least square algorithm [18–22, 35–41]. For example, the forgetting factor is introduced in the recursive least square estimation, and the past time of data will be forgotten by index rate [42, 43]. However, it still cannot discard the past time of data [16] but just weakens the impact of the past time of data for the current parameter estimation. Another method is to use window method for the time series data [16, 23, 44]. This method can discard the past time of data flexibly and eliminate the impact of the past time of data for future parameter estimation. The window size can be set flexible according to practical application. In this paper, we adopt windowed least square algorithm for stator resistance , , and inductance estimation and make a comparison with recursive least square and extended kalman Filter (EKF). From the simulation result, we can see that windowed least square algorithm has a better performance in convergence speed and identification precision for fixed parameters and parameters with time varying characteristics. From the view of algorithm complexity, the windowed least square algorithm is suitable for engineering realization in embedded chip, such as DSP and ARM.
This paper is consisted of the five sections. Section 2 describes the principle of least square theory and the recursive least square algorithm. Section 3 illustrates the windowed least square algorithm. Section 4 does some simulations for PMSM parameter estimation. Section 5 analyses the simulation results and shows some conclusions.
2. Least Square Estimation and Recursive Least Square Estimation
2.1. The Principle of Least Square Estimation
The earliest stimulus for the development of the least square estimation theory was apparently provided by astronomical studies in which planet and comet motions were studied using telescopic measurement data. The principle of the parameter estimation is simple and does not need any statistical characteristics of the variables. It is used in system identification and parameter estimation widely. The least square estimation still can provide an accurate solution when other identification methods lose efficacy.
Supposing and are the observation sequences of and at . The relationship of and is expressed where is the measured parameter set and is the number of parameters. We hope to estimate their values by the observation value of and at different time sequences. is the time sequences; to estimate the parameters , is required, and if , we can get the single solution from (1) as (2): where is the estimation value of and inverse matrix of is required:
where is the error vector.
The target function is shown in the following:
Obtaining to make minimum, The result is
is the least square estimate, LS of .
2.2. Recursive Least Square Estimation
In practical parameter estimation, the data is always constantly to be refreshed. Therefore, we can further deduce (2) to a recursion algorithm. This algorithm does not need to compute the inverse matrix calculation repeatedly and reduces the timeconsuming and system resources occupation.
The least square estimation using groups of data is shown as follows:
The moment data is , and then where
The new least estimation equation is shown as follows:
In order to get out of inverse matrix calculation of , is deduced as follows:
Equation (11) is the recursive least square (RLS) estimation. Recursive least square algorithm is called the generalization Kalman filter algorithm [45, 46]. It is the engineering realization method of the least square estimation theory [17].
From the calculation of least square estimation and recursive least square estimation, we can see that the past time of data has a big effect to future parameter estimation, and a large number of data calculations have occupied the system resources seriously. Therefore, it is difficult to be realized in embedded systems.
3. Windowed Least Square Estimation
Recursive least square algorithm can be used to realtime parameter estimation. However, the algorithm uses the past time of data, and the past time of data has the same importance as the present data in the algorithm. It weakened the importance of current data, caused a lot of system resources possession, and affected the estimation speed and precision [44]. In order to guarantee the instantaneity of parameter estimation, the paper adopts windowed least squares (WLS) to estimate the parameters of PMSM. The algorithm simulates the window processing function of communication signal. The time series data used for parameter estimation are added window handle, to reduce the calculation of estimation and system resources possession, making the algorithm easy for engineering realization.
Suppose that , the parameter estimation by , , is as follows:
where
Consider increasing a group of data , and then the parameter estimation is shown as follows [16, 23, 44]:
where
Therefore, .
Consider eliminating a group of data , and then the parameter estimation is shown as follows, where
Therefore, the estimation result is shown as follows:
where
Therefore, for any moment
where is the window size, and
The window size is adjustable according to actual needs, based on the data length of regulation. This can guarantee the speed of calculation and can reduce the system resources possession too. At this time, the parameter estimation is related to the current data sample, the past time of data has no effect on parameter estimation, and this can ensure the instantaneity and accuracy of the parameter estimation.
4. Simulations
4.1. PMSM Model
The voltage equations, flux linkage equations, and electromagnetic torque equations of PMSM in , frames are as follows [47, 48]:
In the steady state,
Flux linkage equations are as follows:
where and are voltages in axis and axis, respectively, and are currents in axis and axis, is phase resistance of stator, and are inductances in axis and axis, is rotor velocity, is flux linkage established by magnets, and is the differential operator.
The mathematical model of PMSM is discretized to estimate parameters (, , and ). The discrete model of PMSM is as follows: where and are as follows:
The PMSM simulation model is established by MATLAB/SIMULINK, and the PMSM running data is obtained by the model. The simulation model is shown in Figure 1.
In MATLAB/SIMULINK, the , , and parameters of PMSM are fixed in simulation. We cannot simulate the time varying characteristic of , , and . Therefore, we design a motor simulation model according to the requirement. The , , and can be changed flexibly in the simulation.
4.2. PMSM Parameters Estimation of Windowed Least Square Algorithm
When , , and are fixed value, the PMSM simulation data is obtained by MATLAB. The windowed least square algorithm is used to identify the parameters. The algorithm with different window sizes is used for , , and identification. From the identification result (Figures 2, 3 and 4), we can see that bigger window size has a better identification result. However, the window size does not obviously have an effect on the promotion of parameter identification precision when , , and are fixed.
Different window sizes have big effect on the results of parameter estimation when the estimated parameters have time varying characteristic. The motor parameters , , and are measured at 23.4°C, 30°C, 40°C, 50°C, 60°C, 70°C, and 80°C. Using piecewise linear method to simulate the time varying of the three parameters, the motor running data is obtained by MATLAB.
The windowed least square is used to identify the , , and . The identification result is shown in Figures 5, 6, and 7 when the , and are changed at the same time. From the Figures 5–7, we can see that shorter window size has lower effect on the promotion of identification precision. However, the window size is too big to improve the identification precision. The identification result is better when the window size is 300–400. In the motor model, is bigger than , so the change of has little effect on the model output. Therefore, the identification result of is not very well. However, the algorithm can also identify the parameter correctly.
4.3. PMSM Parameters Estimation of Extended Kalman Filter
The Kalman filter is a common parameter identification method. It is proposed in 1960 by Kalman [49]. The theory is applied to practical engineering immediately when it is put forward. The Apollo program and C5 plane navigation system design are the most successful application examples. Extended Kalman filter (EKF) is an improved model of the Kalman filter which is one of the most widely applied in nonlinear system filter.
Discrete system state equation of EKF is where
where is the system state vector, is the system input vector, is the system observation vector, is the system random noise vector, is the system random observation noise vector. and are noise sequences with zero mean, and the covariance matrices are and .
is the sampling period. the discrete linear state space equation (29) of PMSM is established by discretization and linearization of the model (30):
Using the simulation model and getting the motor output , , , , ; the initial values of , , and in EKF algorithm are
When , , and of motor are fixed, the identification result table of EKF, recursive least square and windowed least square, algorithm is shown in Table 1.

From Table 1 we can see that identification result of EKF algorithm is as good as the windowed least square algorithm when , , and are fixed. The comparison diagrams of identification result are shown in Figure 8 when the parameters are fixed.
(a) Estimation result of
(b) Estimation result of
(c) Estimation result of
EKF and recursive least square algorithms cannot achieve reasonable result when the parameters have time varying characteristic or have a drastic change. However, windowed least square algorithm can achieve good identification result when , , and have time varying characteristic at the same time (Figures 5–7).
5. Analysis and Conclusion
Through the previous different PMSM parameters identification experiments, we can see the following.(1)When the parameters of PMSM have no time varying characteristic, three methods can achieve better identification result in precision and accuracy. In the calculation and instantaneity of identification, recursive least square algorithm has a fatal flaw of data saturation, so the precision and accuracy of the algorithm are hard to guarantee. It is difficult to realize in embedded system the realtime parameters identification due to the amount of calculations and system resources possession of EKF [28]. The window size of windowed least square algorithm is flexible, so we can choose the collected data according to the changes of the parameters. It will reduce the influence of the past time of data to the current parameter identification, guarantee the accuracy and instantaneity of identification, and reduce the system resources possession at the same time.(2)When the parameters of PMSM have strong time varying characteristic, the EKF and recursive least square algorithms cannot guarantee the precision and accuracy of identification. However, windowed least square algorithm can get better identification result. Therefore, EKF and recursive least square algorithms are suitable for fixed parameters estimation or parameters with weak time varying characteristic identification. Windowed least square algorithm can get a good result both for fixed parameters and for time varying parameters identification.
Embedded technology is widely used in the motor driver and controller at present. However, the embedded chip (MCU, DSP, ARM, etc.) has certain restriction in computing speed and storage space. Therefore, windowed least square algorithm is a better choice for PMSM parameters identification of motor driver and controller. This paper is the beginning of work. There are a lot of work to do, such as transplant the algorithm to practical controller and control system (in Figures 9 and 10) which is designed to control the PMSM in practical application.
Acknowledgment
This paper is supported by the Shandong Province Science and Technology Development Plan of China (Grant no. 2011GGE27053).
References
 M. A. Rahman and P. Zhou, “Analysis of brushless permanent magnet synchronous motors,” IEEE Transactions on Industrial Electronics, vol. 43, no. 2, pp. 256–267, 1996. View at: Publisher Site  Google Scholar
 M. Ooshima, A. Chiba, A. Rahman, and T. Fukao, “An improved control method of buriedtype IPM bearingless motors considering magnetic saturation and magnetic pull variation,” IEEE Transactions on Energy Conversion, vol. 19, no. 3, pp. 569–575, 2004. View at: Publisher Site  Google Scholar
 K. Liu, Z. Q. Zhu, Q. Zhang, and J. Zhang, “Influence of nonideal voltage measurement on parameter estimation in permanentmagnet synchronous machines,” IEEE Transactions on Industrial Electronics, vol. 59, no. 6, pp. 2438–2447, 2012. View at: Publisher Site  Google Scholar
 F. Caricchi, F. Crescimbini, and O. Honorati, “Lowcost compact permanent magnet machine for adjustablespeed pump application,” IEEE Transactions on Industry Applications, vol. 34, no. 1, pp. 109–116, 1998. View at: Publisher Site  Google Scholar
 P. Milanfar and J. H. Lang, “Monitoring the thermal condition of permanentmagnet synchronous motors,” IEEE Transactions on Aerospace and Electronic Systems, vol. 32, no. 4, pp. 1421–1429, 1996. View at: Publisher Site  Google Scholar
 T. Kailath, “An innovations approach to leastsquares estimation—part I: linear filtering in additive white noise,” IEEE Transactions on Automatic Control, vol. 13, pp. 646–655, 1968. View at: Google Scholar  MathSciNet
 D. G. Robertson and J. H. Lee, “A least squares formulation for state estimation,” Journal of Process Control, vol. 5, no. 4, pp. 291–299, 1995. View at: Publisher Site  Google Scholar
 J. S. Gibson, G. H. Lee, and C. F. Wu, “Leastsquares estimation of input/output models for distributed linear systems in the presence of noise,” Automatica, vol. 36, no. 10, pp. 1427–1442, 2000. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 S. Tunali and I. Batmaz, “Dealing with the least squares regression assumptions in simulation metamodeling,” Computers & Industrial Engineering, vol. 38, no. 2, pp. 307–320, 2000. View at: Publisher Site  Google Scholar
 R. M. FernandezAlcala, J. NavarroMoreno, and J. C. RuizMolina, “Linear leastsquare estimation algorithms involving correlated signal and noise,” IEEE Transactions on Signal Processing, vol. 53, no. 11, pp. 4227–4235, 2005. View at: Publisher Site  Google Scholar  MathSciNet
 V. Krätschmer, “Leastsquares estimation in linear regression models with vague concepts,” Fuzzy Sets and Systems, vol. 157, no. 19, pp. 2579–2592, 2006. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 M. J. GarcíaLigero, A. HermosoCarazo, and J. LinaresPérez, “Leastsquares linear estimation of signals from observations with Markovian delays,” Journal of Computational and Applied Mathematics, vol. 236, no. 2, pp. 234–242, 2011. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 S. Ma, C. Quan, R. Zhu, C. J. Tay, L. Chen, and Z. Gao, “Application of leastsquare estimation in whitelight scanning interferometry,” Optics and Lasers in Engineering, vol. 49, no. 7, pp. 1012–1018, 2011. View at: Publisher Site  Google Scholar
 Q. Wang and L. Zhang, “Least squares online linear discriminant analysis,” Expert Systems with Applications, vol. 39, no. 1, pp. 1510–1517, 2012. View at: Publisher Site  Google Scholar
 C. J. Demeure and L. L. Scharf, “Sliding windows and lattice algorithms for computing QR factors in the least squares theory of linear prediction,” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. 38, no. 4, pp. 721–725, 1990. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 K. Zhao, L. Fuyun, H. LevAri, and J. G. Proakis, “Sliding window orderrecursive leastsquares algorithms,” IEEE Transactions on Signal Processing, vol. 42, no. 8, pp. 1961–1972, 1994. View at: Publisher Site  Google Scholar
 H. Liu and Z. He, “A slidingexponential window RLS adaptive filtering algorithm: properties and applications,” Signal Processing, vol. 45, no. 3, pp. 357–368, 1995. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 K. Yoo and H. Park, “Fast residual computation for sliding window recursive least squares methods,” Signal Processing, vol. 45, no. 1, pp. 85–95, 1995. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 Y. Xia, M. S. Kamel, and H. Leung, “A fast algorithm for AR parameter estimation using a novel noiseconstrained leastsquares method,” Neural Networks, vol. 23, no. 3, pp. 396–405, 2010. View at: Publisher Site  Google Scholar
 A. Aknouche, E. M. AlEid, and A. M. Hmeid, “Offline and online weighted least squares estimation of nonstationary power $ARCH$ processes,” Statistics & Probability Letters, vol. 81, no. 10, pp. 1535–1540, 2011. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 L. Xie, H. Yang, and F. Ding, “Recursive least squares parameter estimation for nonuniformly sampled systems based on the data filtering,” Mathematical and Computer Modelling, vol. 54, no. 12, pp. 315–324, 2011. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 J. Oliver, R. Aravind, and K. M. M. Prabhu, “Improved least squares channel estimation for orthogonal frequency division multiplexing,” IET Signal Processing, vol. 6, no. 1, pp. 45–53, 2012. View at: Publisher Site  Google Scholar  MathSciNet
 T. Sadiki, M. Triki, and D. T. M. Slock, “Window optimization issues in recursive leastsquares adaptive filtering and tracking,” in Proceedings of the 38th IEEE Annual Asilomar Conference on Signals, Systems and Computers, pp. 940–944, Pacific Grove, Calif, USA, November 2004. View at: Google Scholar
 G. Welch and G. Bishop, “An introduction to the Kalman filter,” 1997. View at: Google Scholar
 P. J. Hargrave, “A tutorial introduction to Kalman filtering,” in Proceedings of the IEE Colloquium on Kalman Filters: Introduction, Applications and Future Developments, pp. 1/1–1/6, 1989. View at: Google Scholar
 M. Gautier and P. Poignet, “Extended Kalman filtering and weighted least squares dynamic identification of robot,” Control Engineering Practice, vol. 9, no. 12, pp. 1361–1372, 2001. View at: Publisher Site  Google Scholar
 H. M. AlHamadi and S. A. Soliman, “Kalman filter for identification of power system fuzzy harmonic components,” Electric Power Systems Research, vol. 62, no. 3, pp. 241–248, 2002. View at: Publisher Site  Google Scholar
 T. Boileau, N. Leboeuf, B. NahidMobarakeh, and F. MeibodyTabar, “Online identification of PMSM parameters: parameter identifiability and estimator comparative study,” IEEE Transactions on Industry Applications, vol. 47, no. 4, pp. 1944–1957, 2011. View at: Publisher Site  Google Scholar
 A. Bechouche, H. Sediki, D. O. Abdeslam, and S. Haddad, “Identification of induction motor at standstill using artificial neural network,” in Proceedings of the 36th Annual Conference on IEEE Industrial Electronics Society (IECON '10), pp. 2908–2913, Glendale, Ariz, USA, 2010. View at: Publisher Site  Google Scholar
 F. Alonge, F. D'Ippolito, and F. M. Raimondi, “Least squares and genetic algorithms for parameter identification of induction motors,” Control Engineering Practice, vol. 9, no. 6, pp. 647–657, 2001. View at: Publisher Site  Google Scholar
 S. Mishra, “A hybrid least squarefuzzy bacterial foraging strategy for harmonic estimation,” IEEE Transactions on Evolutionary Computation, vol. 9, no. 1, pp. 61–73, 2005. View at: Publisher Site  Google Scholar
 R. Liao, H. Zheng, S. Grzybowski, and L. Yang, “Particle swarm optimizationleast squares support vector regression based forecasting model on dissolved gases in oilfilled power transformers,” Electric Power Systems Research, vol. 81, no. 12, pp. 2074–2080, 2011. View at: Publisher Site  Google Scholar
 R. A. Zadeh, A. Ghosh, and G. Ledwich, “Combination of Kalman filter and leasterror square techniques in power system,” IEEE Transactions on Power Delivery, vol. 25, no. 4, pp. 2868–2880, 2010. View at: Publisher Site  Google Scholar
 S. Bolognani, R. Oboe, and M. Zigliotto, “Sensorless fulldigital PMSM drive with EKF estimation of speed and rotor position,” IEEE Transactions on Industrial Electronics, vol. 46, no. 1, pp. 184–191, 1999. View at: Publisher Site  Google Scholar
 M. Haardt, “Structured least squares to improve the performance of ESPRITType algorithms,” IEEE Transactions on Signal Processing, vol. 45, no. 3, pp. 792–799, 1997. View at: Publisher Site  Google Scholar
 M. Ghogho, A. Swami, and A. K. Nandi, “Nonlinear least squares estimation for harmonics in multiplicative and additive noise,” Signal Processing, vol. 78, no. 1, pp. 43–60, 1999. View at: Publisher Site  Google Scholar
 J. Angeby, “Estimating signal parameters using the nonlinear instantaneous least squares approach,” IEEE Transactions on Signal Processing, vol. 48, no. 10, pp. 2721–2732, 2000. View at: Publisher Site  Google Scholar
 J. F. Weng and S. H. Leung, “Nonlinear RLS algorithm for amplitude estimation in class a noise,” IEE Proceedings—Communications, vol. 147, no. 2, pp. 81–86, 2000. View at: Publisher Site  Google Scholar
 D. Zachariah, M. Sundin, M. Jansson, and S. Chatterjee, “Alternating leastsquares for lowrank matrix reconstruction,” IEEE Signal Processing Letters, vol. 19, no. 4, pp. 231–234, 2012. View at: Publisher Site  Google Scholar
 R. Montoliu and F. Pla, “Generalized least squaresbased parametric motion estimation,” Computer Vision and Image Understanding, vol. 113, no. 7, pp. 790–801, 2009. View at: Publisher Site  Google Scholar
 Z. Yingjie and G. Liling, “Improved moving least squares algorithm for directed projecting onto point clouds,” Measurement, vol. 44, no. 10, pp. 2008–2019, 2011. View at: Publisher Site  Google Scholar
 S. Seongwook, J.S. Lim, S. J. Baek, and K.M. Sung, “Variable forgetting factor linear least squares algorithm for frequency selective fading channel estimation,” IEEE Transactions on Vehicular Technology, vol. 51, no. 3, pp. 613–616, 2002. View at: Publisher Site  Google Scholar
 S. Morimoto, M. Sanada, and Y. Takeda, “Mechanical sensorless drives of IPMSM with online parameter identification,” IEEE Transactions on Industry Applications, vol. 42, no. 5, pp. 1241–1248, 2006. View at: Publisher Site  Google Scholar
 H. Sakai and H. Nakaoka, “Fast sliding window QRDRLS algorithm,” Signal Processing, vol. 78, no. 3, pp. 309–319, 1999. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 S. Reece and S. Roberts, “An introduction to Gaussian processes for the Kalman filter expert,” in Proceedings of the 13th Conference on Information Fusion (FUSION '10), pp. 1–9, 2010. View at: Google Scholar
 A. Giorgano, F. M. Hsu, and J. Wiley, “Book review: leastsquare estimation with applications to digital signal processing,” IEE Proceedings F—Communications, Radar and Signal Processing, vol. 132, no. 7, 1985. View at: Publisher Site  Google Scholar
 S. Wang, R. Zhao, W. Chen, G. Li, and C. Liu, “Parameter identification of PMSM based on windowed least square algorithm,” in Proceedings of the Manufacturing Science and Technology (ICMST '11), pp. 5940–5944, Singapore, 2012. View at: Google Scholar
 S. Wang, S. Shi, C. Chen, G. Yang, and Z. Qu, “Identification of PMSM based on EKF and elman neural network,” in Proceedings of the IEEE International Conference on Automation and Logistics (ICAL '09), pp. 1459–1463, Shenyang, China, 2009. View at: Publisher Site  Google Scholar
 R. E. Kalman, “A new approach to linear filtering and prediction problems,” Transactions of the ASME—Journal of Basic Engineering D, vol. 82, pp. 35–45, 1960. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2013 Song Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.