Research Article | Open Access
Predrag Petrović, Nada Damljanović, "Dynamic Phasors Estimation Based on Taylor-Fourier Expansion and Gram Matrix Representation", Mathematical Problems in Engineering, vol. 2018, Article ID 7613814, 17 pages, 2018. https://doi.org/10.1155/2018/7613814
Dynamic Phasors Estimation Based on Taylor-Fourier Expansion and Gram Matrix Representation
The paper presents a new approach to estimation of the dynamic power phasors parameters. The observed system is modelled in algebra of matrices related to its Taylor-Fourier-trigonometric series representation. The proposed algorithm for determination of the unknown phasors parameters is based on the analytical expressions for elements of the Gram’s matrix associated with this system. The numerical complexity and algorithm time are determined and it is shown that new strategy for calculation of Gram’s matrix increases the accuracy of estimation, as well as the speed of the algorithm with respect to the classical way of introducing the Gram’s matrix. Several simulation examples of power system signals with a time-varying amplitude and phase parameters are given by which the robustness and accuracy of the new algorithm are confirmed.
The very intense and rapid development of electronic technologies, including the production of renewable energy sources (commercial solar, wind power plants, and biomass power plants) and power devices, caused a change in the structure of the traditional power system. Electrical variables, such as the basic harmonics amplitude and its frequency, can be significantly altered in micronetworks, weak networks, and networks of the island type due to reduced capacity in terms of short-circuit currents. In addition, the harmonic is injected into the system using electrical electronic equipment . Under these circumstances, an ideal algorithm for assessing and estimation of the pharos must enable quick, accurate, and steady monitoring of the changing parameters of the electrical signals that are contaminated by the present harmonic components.
In the last few years, many algorithms have been proposed in the literature for evaluating the phases in different dynamic states and conditions that can be controlled in the network. In general, they can be classified into methods based on the application of discrete Fourier transform (DFT) [2–4] and non-DFT-based methods. Each of the algorithms requires a harmonic/pharos model and uses some of the specific techniques that model the parameters of the observed system. In accordance with the modelling method, the measurement method, the algorithms can be divided into two main classes: algorithms that rely on the pure sinusoidal signal model (static model) and algorithms based on a nonsinusoidal model (dynamic model) .
A simultaneous estimation of phasor and frequency based on the application of the fast recursive Gauss-Newton algorithm was proposed in , while the method based on the modified Fourier transformation in order to eliminate the DC offset was presented in . The paper  proposes a new method based on an adaptive band-pass filter in order to evaluate the phasor. On the other hand, the authors of  introduce a special angle-shifted energy operator to separate the value of the instantaneous amplitude of the phasor. The least square curve fitting approach was proposed in  in order to eliminate the unwanted effect of saturation of the current transformer. Measurement of the phase and frequency during the transient processes was considered in , while the dynamic estimation of the phase based on the application of maximally flat differentiators was proposed in  and the phasorlet in . The paper  introduces an approach to estimate the parameters of the phasor based on recursive wavelet transformation. Taylor-Fourier algorithm  approximates the dynamic phase with the second-order Taylor expansion and the least square observer. The Taylor-Kalman method based on the Kalman observer in order to achieve nondelayed dynamic phase estimation is described in . This method is further enhanced by the development of the state space for harmonic infiltration in  and is called Tailor Fourier Kalman. The Prony algorithm  was used to estimate the phasor described by the exponential amplitude and the linear phase, with no Taylor expansion. There are other methods that are modifications of earlier methods [19, 20]. The Shank method is another method for estimating a dynamic phasor, using the least square and consecutive delays of the unit response system . The algorithm  for TFT (Taylor-Fourier transform) harmonic analysis uses recursive multiple-resonator-based computational techniques, which enable the reduction of both the computational cost and the memory requirements of the algorithm.
In  a more precise dynamic model describing the complex trajectory of the dynamic phasor is derived owing to a revised state transition equation of the rotating phasor and its derivatives. Based on the improved dynamic model , a modified Taylor-Kalman Filter for instantaneous dynamic phasor estimation is developed which is coincident with the self-adaptive nature of the Kalman filter principle. An extension of the Taylor Weighted Least Squares (TWLS) algorithm for the estimation of the phasor, frequency, and ROCOF, Rate-Of-Change-Of-Frequency, parameters of an electric waveform has been analyzed in . Paper  introduces a dynamic phasor estimation method for PMUs/IEDs based on a modified time domain hybrid method. Dynamic phasor is estimated using the Taylor expansion, where frequency deviation is derived directly from fitting parameters to avoid magnification of fitting errors. A double suboptimal-scaling factor-adaptive strong-tracking Kalman filter (DSTKF)-based phasor measurement unit algorithm which can meet the accuracy requirement of the IEEE standard C37.118.1 under the dynamic condition was proposed in . This method uses a kth Taylor polynomial to linearize the complex exponential of the signal model and estimates the dynamic phasor using DSTKF. In , a combination of the least square-based Prony analysis and Taylor expansion called Taylor–Prony is proposed to estimate the dynamic phasor.
In this paper, a special transformation (representation) of Taylor-Fourier expansion and corresponding Gram matrix is used to estimate the dynamic phasors from input phasorlets in real domain, based on synchronously sampled values of the input signal. The dynamic system’s behaviour is described in algebra of matrices related to their Taylor-Fourier-trigonometric series representation. The explicit formulas for calculation of elements of the associated Gram’s matrix are given. In this way, we are in a position to improve the computational performance of the proposed algorithm, as regards precision and speed. Namely, the proposed algorithm is based on matrix multiplication. It is a well-known fact that mathematical definition of multiplication of matrices gives an algorithm that takes time to multiply a matrix of type with a matrix of type (in the case of square -matrices, it takes time). If we use the explicit formulas for elements of Gram’s matrix in our algorithm, then one matrix multiplication is avoided, and the task is reduced to consecutive calculations of the values of specific polynomials. Moreover, each element of Gram’s matrix depends on the number of samples (it is expressed in terms of a polynomial of variable ), but the time necessary for this calculation depends on the degree of that polynomial. Consequently, the time needed for calculation of Gram’s matrix remains the same even if the number of samples is increased. Another important reason for using analytical expressions for elements of Gram’s matrix instead of their interpretation through the usual matrix multiplication can be found in the fact that rounding of exact numbers is almost unavoidable when reporting many computations and these rounding errors generally accumulate (explicit formulas for elements of Gram’s matrix induce smaller round-off errors in the case of large number of samples).
The accuracy of the proposed method is compared with some well-known methods from literature, illustrating the capability of tracking dynamic phasors, especially in comparison with other procedures based on the least squares method. Sinusoidal and step changes of the amplitude and phase, harmonic condition, frequency tracking test, and computation time are different tests which are used to validate the proposed method, according to the definition and test cases in the standard . The potential of the proposed approach is demonstrated by simulating various numerical signals in MATLAB. The proposed algorithm is particularly suitable for the integration of distributed generating sources with microgrids, when fast detection of faults and the islanding condition is required.
2. Dynamic Signal Model and Algorithm Description
The behaviour of a power system under oscillation is usually modelled by trigonometric series where and are the amplitude and the phase functions which represent variations of the mth dynamic harmonic over time, and ( is frequency of fundamental component). In an equivalent form, the behaviour of such power system can be represented aswhere
Clearly, the following holdsand
Let and be approximated with two Taylor series within a short period of time near the reference time , i.e.,and
Therefore, we have
In a discrete version, this can be written as the system of equationswhere .
For each , the mth harmonic representation is
In order to perform the necessary and proposed calculations for the estimation of unknown phasors parameters from input phasorlet, samples of the processed signal are first transformed through the Fourier nonrecursive algorithm [29, 30]. After that they are introduced in the form of input parameters to the algorithm proposed in this paper. The mathematical model of the algorithm for digital filtering is defined aswhere is nth filtered sample of the mth harmonic voltage or current signal, is the processed signal–sample in the time moment , is the sampling period, and is the number of samples, . After the extraction we obtain the vector of the filtered samples, the length of , on which to apply the proposed procedure. For the realization of this filter transformation, the FIR structure described in  can be used, but it was chosen (11) for the reason of obtaining a simpler and faster procedure for estimating the processed phasors.
Let us observe that for , we obtain the following system of equations
The traditional algorithm for estimating the value of the phasor is based on the subsystem of (12), in which only two column vectors are taken into account; in this way the dynamic phasor is approximated by Tailor's zero-order polynomial over the interval in which observations are made. This generates a staircase function, with a variable step from one interval to another. Such a model is accurate only when the input signal is in the stationary state. This is certainly not enough in a situation where oscillations in the power system occur, in which the first and second derivatives are as relevant as the constant term. A matrix representation of this discrete system (12) has the formwhere And
Our goal is to minimize the sum of squares of the residuals i.e., to find the solution to the matrix equation
The matrix is called the Gram’s matrix. The best solution (in the least squares sense) exists provided that the Gram's matrix is invertible, which is fulfilled when the column vectors H are linearly independent . The Grammian inversion depends on the size of the interval N and the order describing the model of the signal itself that is the subject of processing. In our approach we assume that , for some (in the case that , the number of samples N covers the whole period).
It is clear that phasors are given by the inverse transform of the phasorlets and that the best solution is given by
The pseudoinverse matrix depends only on the parameters of the adopted signal model. The estimation of the phasors in the center of the evaluation interval where Tailor's error is zero is correct if the input signal is well described by the adopted model for which the least mean squared error (LMS) is also zero. An LMS error would affect the estimate if the signal was outside the projection subspace of the LMS algorithm.
3. Gram’s Matrix of Dynamic Signal Model
In this section, we will investigate the Gram's matrix of the dynamic signal model (12), and for each element of that matrix, an explicit formula will be given.
The Gram’s matrix has the form where , and , and for all and , the elements , , and are finite trigonometric series
With the goal of calculating the elements , , and , we will consider finite series
Clearly, for the following holds
The series , , and can be represented equivalently as
It is a well-known fact that an analytic solution for a sum of powers of positive integers is where is Riemann zeta function [33, 34], is Hurvitz zeta function , and is generalized harmonic number . The Swiss mathematician Jacob Bernoulli (1654-1705) derived the formula for the finite sum of powers of consecutive positive integers  representing as polynomial in of degree . In the case that the power takes values in the set , the corresponding polynomials are presented in Table 1.
Now, let us consider the finite sums involving trigonometric functions
The following holds for their exponential formwhere
For arbitrary , let functions be defined in the following way:
Clearly, for hold and
Therefore, we have and implicitly we obtain
The series , , and can be represented, in the terms of and , in the following way:
Also, these series can be represented in the terms of , , and in the following simple notation:
In the main section of this article, the synchronous model is observed, i.e., the number is chosen with respect to the relation . For and , this leads to the values given in Table 3.
If we represent each in in its expanded form as a polynomial in and of degree (the degree of each term in this polynomial in two variables is the sum of the exponents in each term), then can be transformed into the form given in Table 4.
In a similar way, by representing each in in its expanded form as a polynomial in and of degree , can be transformed into the form given in Table 5.
Now, by (27) we obtain the elements of Gram's matrix . Namely, for all and , the elements are given by
Further, for all and , the elements are given by