Documente Academic
Documente Profesional
Documente Cultură
rule for assigning to every outcome ξ of an event S a number J (∞) and the minimum value of cost function J min is called
x ( ξ ). A stochastic processes x ( t ) is a rule for assigning to the excess mean square error J ex (∞) , the cost paid by the
every ξ a function x ( t , ξ ). Thus a stochastic process is stochastic mechanism to control the tap weights in the LMS
dependent on both t and ξ . filter. The misadjustment Μ is given as
A stochastic process describes how a statistical
environment based on probabilistic laws evolves with time. It J ex (∞)
is a collection of infinite random variables on each and every Μ= (4)
J min
time sample t . Consider a discrete time stochastic processes
represented by the tap inputs
and is a measure of how close the LMS algorithm is to the
u (n), u (n − 1),...., u (n − M + 1) to a LMS filter with optimal solution.
( M − 1) delay elements. The LMS algorithm is a linear Control of the step size plays an important role in the
adaptive filtering algorithm with two separate processes, variability of the estimates and the convergence time of the
filtering processes and adaptive processes. During the filtering LMS algorithm in a non-stationary environment. In a
processes the desired response d ( n) is and the tap input stationary environment the minimum cost function J min is
vector u (n) are used to generate an error vector e(n) . fixed, but in a non-stationary environment J min takes a time
In adaptive processes the input vector u( n) and the error varying form. Furthermore, due to the presence of a gradient
vector e( n) are compared and a correction is applied to the noise in the LMS algorithm, the tap weight vector follows a
Brownian movement around the minimum point of error
tap weight vector. The scaling parameter used for this
performance rather than terminating on the Weiner solution
correction is called the step size parameter ( μ ). The three
[13]. So the adaptive algorithm is further burdened as it has to
important equations governing the LMS operation described track the minimum point first and then track the solution
above are [13]: around the minimum point which makes the adaptive
algorithm produce more variable estimates.
According to first-order Markov process, the tap-weight
y (n) = w H (n)u(n − 1) (1)
vector w o ( n) in a non-stationary environment is defined by
the following relationship [13]:
e ( n ) = u( n ) − y ( n ) (2)
w o (n + 1) = aw o (n) + ω (n) (5)
w (n + 1) = w (n) + μu(n − 1)e * (n) (3) where ω (n) is the processes noise vector with zero mean and
T correlation matrix R ω and a is a parameter very close to
where u(n-1) = [u(n-1) u(n-2). . .u(n-M)] is the same
unity.
data vector with M past values, w(n) = [w1(n) w2(n)…. In a non-stationary environment the misadjustment
wM(n)]T is a time varying filter tap weights, y (n) is the parameter is not only the measure of how close the solution is
filter output, e( n) is the error estimate, μ is the step size but is also a measure of the degree of non-stationarity.
parameter, and M is the filter order.
J ex (∞) tr[R ω R u ]
A stochastic processes x( t ) is strictly stationary if its Μ= = =α2 (6)
statistical properties are time invariant i.e. two samples of the J min σv 2
derivative of the weight vector at a sample (iteration) with where L is the length of the input data and M represents the
respect to the step size parameter of the same sample. number of tap-weights of the filter.
The difference between the LMS and the ASLMS algorithm
∂ w(n) is in (7) where the step size is updated every iteration. This
γ (n) = (8) step allows the ASLMS algorithm to track the minimum point
∂ μ (n) of error in less time than an LMS algorithm. The time of
convergence of an estimate tracked by the ASLMS algorithm
and ρ is a small positive constant which controls the update is far less than the time taken by the LMS algorithm. Due to
of the step size parameter. If the gradient vector is included in the presence of σ v , the irreducible error variance, the
the update of the step size parameter, the update in step size
tracking of the estimate is more variable using the ASLMS
during each iteration of the adaptation is reduced, therefore
algorithm.
the error estimate e( n) during each iteration is reduced and
this results in better tracking performance in terms of III. PERFORMANCE OF ASLMS ON MEGAWATT DATA
convergence time.
The 19-machine test system shown in Fig. 2 is a reduced order
The result of implementing the gradient vector with the step
replica of the western North American power grid was used to
size parameter in (7) on the LMS algorithm (1)-(3) is the
generate simulation data [15]. The system contains five inter-
adaptive step-size LMS (ASLMS) algorithm. A block diagram
area modes and several local modes. The MATLAB Power
of the ASLMS algorithm is shown in Fig. 1.
Systems Tool Box [16] was used to linearize the non-linear
system into a 92nd order linear system. A one hour window of
FIR FILTER megawatt data was generated from line 17 between buses 22
y
u(n) u
+ and 26. Both stationary modes and moving modes are
Z-1 W(n) γ (n) ∑
e(n) available in the system. The stationary mode location and
- strength are shown in Table I. The location of the mode is
defined by its frequency and the strength is defined by the
LMS percent damping ratio. The stationary mode at 0.2624Hz and a
update damping ratio of 10.33% was the mode used through out this
Fig. 1. Block diagram of ASLMS algorithm. study.
21
23
The weight vectors generated by the ASLMS algorithm 31
9 7
26
roots of the z-domain polynomial are calculated from the 33 34
42
−1 −Μ
a ( z , n) = 1 − w 1 (n) z −... w Μ (n) z
22
(9) 10 8
40
32
28 20
36 37 29 30
where T is the sampling period. The total number of roots will Fig. 2. 19-machine reduced order replica of the western North
be equal to the filter tap length M .The roots calculated American power grid.
contain the information about the frequency and damping ratio
of the dominant mode. Table I
For a non-stationary data and a small μ , the LMS Stationary Frequency and Percentage Damping of the
algorithm will converge if [13]: 19- Machine System
damping ratio versus time with zero initial weight vectors and data set using an initial weight vector estimate 10
for different values of ρ . If the value of ρ is decreased to a minutes into the previous LMS estimates (LMS-
very small value like 5.55e-04 and 2.85e-04 in the frequency ASLMS).
and damping estimates, respectively, the estimates behave like 3. The LMS algorithm was reapplied to the same data
an ordinary LMS estimate. Although the ASLMS algorithm set using an initial weight vector estimate 10 minutes
has a more variable estimate, the convergence time is lower into the previous ASLMS estimates (ASLMS-LMS).
when compared to the LMS algorithm. A combination of the
LMS and the ASLMS algorithm was used to achieve a lower The step size was also reduced by a factor of 10 (7.8231 e-07)
convergence time and less variability for the estimates. to help reduce the variability in the mode estimates. Figs. 8
and 9 show the estimates of frequency and damping ratio for
the three cases mentioned above. The step size parameter
could not be reduced further due to the convergence time
constraints. From Figs. 8 and 9 it is clear that the weight
vector from previous ASLMS estimates gives a better estimate
when compared to the weight vector from the previous LMS
estimates. The convergence time in both the frequency and
damping estimates is reduced using case 3.
Using the initial weight vector estimate from 10 minutes lower time of convergence when compared to the estimates
into the previous ASLMS estimates (case 3) improves the from the LMS algorithm. The small constant ( ρ ) was set to
convergence time of the frequency estimate in Fig. 8 while the 6.67 e-06 in the frequency estimate in Fig. 10 and 2.00 e-06 in
estimates in cases 1 and 2 did not converge even after tracking the damping ratio estimate in Fig. 11. The ASLMS algorithm
the full 60 minutes of data. The ASLMS algorithm with the converges to the AR estimate in both the frequency and
initial weight vector estimate 10 minutes into previous LMS damping ratio cases. The damping ratio estimate using
estimate (case 2) allows the damping estimate in Fig. 9 to ASLMS shows better performance in terms of convergence
converge in half the time of the full data while the LMS-LMS time. The variability of the estimate is higher in the frequency
case produces a poor estimate. The initial weight vector estimate than in the damping ratio estimate. The variability of
estimate from 10 minutes into previous ASLMS algorithm the damping estimate from the ASLMS algorithm is about the
(case 3) produces a better damping estimate when compared same as the LMS algorithm.
to case 2 which produces a better estimate than case 1.
10 0.2751 8.347
15 0.2745 7.379
18 0.2721 7.395
with a cold start for three different values of ρ (6.67 e-06, damping ratio estimates for case 2 is 8.33 e-06 and for case 3
4.44 e-06, and 1.00 e-06). Similarly, the damping ratio was is 1.42 e-05.
then estimated over time in Fig. 13 using the ASLMS
algorithm with a cold start for three different values of ρ
(1.00 e-05, 6.67 e-06 and 5.00 e-07). From Figs. 12 and 13, as
the value of ρ decreases the variability of the estimate
decreases, but the convergence time increases.
Fig. 14. Mode frequency vs. time for megawatt ambient data
(18.85 minutes, μ =8.7448 e-08, LMS-ASLMS: ρ =1.33 e-
06 ASLMS-LMS: ρ =6.67 e-06)
Fig. 12. Mode frequency vs. time for ambient megawatt data
(18.85 minutes, cold start, μ =8.7448 e-07 and ρ =1.00 e-05,
6.67 e-06, 4.00 e-06).
Fig. 15. Damping ratio vs. time for megawatt ambient data
(18.85 minutes, μ =8.7448 e-08, LMS-ASLMS: ρ =8.33 e-
06, ASLMS-LMS: ρ =1.42 e-05)
ratio estimates. Thus the ASLMS algorithm works better with [14] Athanasios Papoulis, S.Unnikrishna Pillai, Probability, Random
Variables and Stochastic Processes, 4th ed., Tata McGraw-Hill Edition.
the damping ratio estimates than the frequency estimates. [15] J. R. Smith, C. S. Woods, F. Fatehi, G. L. Keenan, and J. F. Hauer, "A
Using an initial estimate from ASLMS algorithm in to Low Order Power System Model with Dynamic Characteristics of the
LMS algorithm (case 3) helps to achieve both faster Western North American System," Proceedings of the North American
Power Symposium, Manhattan, Kansas, Sept. 1994.
convergence and less variability compared to case 2 where an
[16] G.J. Rogers, Power Systems Toolbox (PST), Cherry Tree Scientific
initial estimate from the LMS algorithm is used in the ASLMS Software, 1998.
algorithm. Further work on the use of the ASLMS algorithm
for estimating electromechanical modes is needed to reduce BIOGRAPHIES
the variability of the mode estimates. One possible solution Richard W. Wies (S’92-M’99) received the B.S., M.S., and Ph.D. degrees in
would be to track the error vector and move from the ASLMS Electrical Engineering from the University of Wyoming in 1992, 1995, and
to LMS algorithm when the error vector is within the 1999, respectively.
He was a Department of Energy AWU Graduate Fellow at the University
tolerance limit set so that faster convergence is achieved using of Wyoming Electric Motor Training and Testing Center during the 93-94
the ASLMS algorithm and lower variability is achieved by academic year, a Department of Energy EPSCOR Research Fellow during the
using the LMS algorithm. 95-96 academic year, and a AWU Graduate Fellow at Pacific Northwest
National Laboratories during the summer of 1996. He has been an assistant
professor of Electrical and Computer Engineering at the University of Alaska
VI. ACKNOWLEDGEMENTS Fairbanks since 1999. His research interests include the application of
statistical signal processing techniques in electric power systems, hybrid
The authors would like to express their appreciation to John electric energy systems, and electric motor drives.
Hauer and Jeff Dagle at Pacific Northwest National Dr. Wies is a member of the IEEE Power Engineering Society.
Laboratory, Bill Mittelstadt from Bonneville Power
Administration, and Dan Trudnowski at Montana Tech for Ashok Balasubramanian received his B.E degree in 2004 in Electrical and
Electronics Engineering from University of Madras, Chennai, India.
their cooperative efforts in research associated with this paper.
He is currently working towards the M.S degree in Electrical Engineering
from the University of Alaska Fairbanks, Fairbanks, AK, USA.
REFERENCES
[1] P. Kundur, Power System Stability and Control, New York: McGraw John W. Pierre (S’86-M’86-S’87-M’91-SM’99) received the BS degree in
Hill, 1994. 1986 in electrical engineering with a minor in economics from Montana State
[2] D. J. Trudnowski and J. E. Dagle, “Effects of Generator and Static-Load University, Bozeman. He also received the M.S. degree in 1989 in electrical
Nonlinearities on Electromechanical Oscillations,” IEEE Transactions engineering with a minor in statistics and the Ph.D. degree in 1991 in
on Power Systems, vol. 12, no. 3, pp. 1283-1288, Aug. 1997. electrical engineering from the Univ. of Minnesota, Minneapolis.
[3] J. F. Hauer, “Applications of Prony Analysis to the Determination of He worked as an electrical design engineer at Tektronix before attending
Modal Content and Equivalent Models for Measured Power System the University of Minnesota. Since 1992, he has been on the faculty in the
Response,” IEEE Transactions on Power Systems, pp. 1062-1068, Electrical and Computer Engineering Department at the University of
August 1991. Wyoming, Laramie, where he is currently a Professor. His research interests
[4] J. F. Hauer, C. J. Demeure, and L. L. Scharf, “Initial Results in Prony include statistical signal processing applied to power systems as well as DSP
analysis of power system response signals,” IEEE Transactions on education.
Power Systems, vol. 5, Feb. 1990, pp. 80-89. Dr. Pierre was a UW NASA Space Grant Faculty Fellow and a Department
[5] D. A. Pierre, D. J. Trudnowski, and J. F. Hauer, “Identifying linear of Energy AWU Faculty Fellow during the summers of 1994 and 1995,
reduced-order models for systems with arbitrary initial conditions using respectively.
Prony signal analysis,” IEEE Transactions on Automatic Control, vol.
37, no. 6, June 1992, pp. 831-835.
[6] J. J. Sanchez-Gasca and J. H. Chow, “Performance comparison of three
identification methods for the analysis of electromechanical
oscillations,” IEEE Transactions on Power Systems, vol. 14 Issue: 3, pp.
995-1002, Aug. 1999.
[7] I. Kamwa, L. Gerin-Lajoie, “State-space system identification-toward
MIMO models for modal analysis and optimization of bulk power
systems,” IEEE Transactions on Power Systems, Vol. 15, no. 1, Feb.
2000.
[8] R. Doraiswami and W. Liu, “Real-time estimation of the parameters of
power system small signal oscillations,” IEEE Transactions on Power
Systems, vol. 8, no. 1, pp. 74-81, Feb. 1993.
[9] P. O'Shea, “The use of sliding spectral windows for parameter
estimation in power system disturbance monitoring,” IEEE Transactions
on Power Systems, vol. 15, no. 4, pp. 1261-1267, Nov. 2000.
[10] R. W. Wies, J. W. Pierre, and D. J. Trudnowski, “Use of ARMA Block
Processing for Estimating Stationary Low-Frequency Electromechanical
Modes of Power Systems,” IEEE Transactions on Power Systems, vol.
18, no. 1, pp. 167-173, Feb. 2003.
[11] R. W. Wies, “Estimating Low-Frequency Electromechanical Modes of
Power Systems Using Ambient Data,” Ph. D. dissertation, University of
Wyoming, Laramie, WY, 1999.
[12] R. W. Wies, J. W. Pierre and D. J. Trudnowski “Use of LMS Adaptive
Filtering Technique for Estimating Low-Frequency Electromechanical
Modes of Power Systems,” Proceedings of the IEEE Power Meeting,
Denver, CO, June 2004.
[13] S. Haykin, Adaptive Filter Theory, 2nd ed., Englewood Cliffs, NJ:
Prentice-Hall, 1991.