Mathematical Problems in Engineering
Volume 2015 (2015), Article ID 512104, 10 pages
http://dx.doi.org/10.1155/2015/512104

Research Article

A Comparative Analysis of Laguerre-Based Approximators to the Grünwald-Letnikov Fractional-Order Difference

Rafał Stanisławski, Krzysztof J. Latawiec, and Marian Łukaniszyn

Department of Electrical, Control and Computer Engineering, Opole University of Technology, Ulica Sosnkowskiego 31, 45-272 Opole, Poland

Received 17 August 2014; Revised 30 December 2014; Accepted 31 December 2014

Academic Editor: Baocang Ding

Copyright © 2015 Rafał Stanisławski et al. 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.

Abstract.

This paper provides a series of new results in both steady-state accuracy and frequency-domain analyses for two Laguerre-based approximators to the Grünwald-Letnikov difference. In a comparative study, the Laguerre-based approximators are found superior to the classical Tustin- and Al-Alaoui-based approximators, which is illustrated in simulation examples.

1. Introduction

Various approximations to a discrete-time fractional difference (FD) have been pursued in order to prevent its possible computational explosion problem and provide high approximation accuracy. Since FD represents in fact (a sort of) an infinite impulse response (IIR) filter, one solution has been to least-squares (LS) fit an impulse/step response of a discrete-time integer-order IIR filter to that of the associated FD [1–3]. However, the problem is to propose a “good” structure of the integer-order filter, possibly involving a low number of parameters. On the other hand, an LS fit of the FIR filter to FD has been analyzed in the frequency domain [4], with the high-order optimal filter providing a good approximation accuracy, at the cost of a remarkable computational effort however. Similar results are reported in other FIR-based approximations to FD [5, 6]. New time-domain modeling concepts for FD have been introduced in [7, 8].

The above introductory reference review is, deliberately, far from completeness. We refer the reader to the excellent surveys of the state of the art in discretization of fractional-order derivatives [9–15], providing a broad spectrum of the discretization machinery. For space saving reasons, we refrain from repeating the discretization principles and technologies covered therein. Rather, we will recall from [16] the main mathematical results on our unique, Laguerre-based approach [16–18] to direct discretization of the Grünwald-Letnikov (GL) fractional-order derivative. The approach advocates the use of the Laguerre filters, rather than, for example, FIR ones. Indeed, the number of FIR components used in, for example, LS-based Pade, Prony, or Shanks discretization schemes [1, 19] is dramatically higher than the number of their Laguerre counterparts. Thus, our Laguerre-based approach is highly competitive in terms of computational efficiency, in addition to a very high approximation accuracy. Also, our discretization approach is computationally superior to the optimization-based competitors of [14]. It is also worth mentioning that another Laguerre-based discretization approach of [20] is related to the Tustin operator which will be shown essentially inferior to our approximation concept.

This paper extends an original concept of the employment of the Laguerre filters in approximation of the Grünwald-Letnikov fractional difference as intimated in [16]. In particular, new effective solutions are offered as a result of time- and frequency-domain analyses of various versions of Laguerre-based fractional differences. An excellent approximator to FD, which is a combination of the classical finite fractional difference (FFD) [8] and finite Laguerre-based difference (FLD) [16], is found superior to the celebrated Al-Alaoui-based approximator. We advocate the contribution of the FFD on the one hand since in the high frequency range it is identical to the original FD [8, 21, 22]. On the other hand, we advantage approximating the medium/low-frequency “tale” of the FD by means of the Laguerre filter FLD [16, 18].

The remainder of this paper is structured as follows. Section 2 outlines the fundamentals of the Grünwald-Letnikov/Riemann-Liouville fractional-order discrete-time derivative (DTD) comprising the Grünwald-Letnikov fractional-order difference (FD). Also, the finite-length approximation to FD, namely, finite fractional difference (FFD), is recalled. The basics of orthonormal basis functions, in particular Laguerre functions, are presented in Section 3, and their application in the construction of the Laguerre-based difference (LD) and combined fractional/Laguerre-based difference (CFLD) is given in Section 4. Finite approximations of LD and CFLD, called finite Laguerre-based difference (FLD) and finite (combined) fractional/Laguerre-based difference (FFLD), respectively, are shown in Section 5, also comprising, for comparison purposes, the Tustin- and Al-Alaoui-based approximations. This most important Section also includes original analyses of both steady-state errors and frequency-domain behaviors of the FLD/FFLD-based versus Tustin- and Al-Alaoui-based models of DTD. The Section is culminated with an important technical theorem enabling estimation of a sampling interval for the FD-based DTD, guaranteeing the prespecified phase accuracy requirement, which can be projected to the FLD- and FFLD-based models of DTD. Simulation examples of this section demonstrate high performances of the FLD- and, in particular, FFLD-based approximations to DTD as compared with the Tustin/Al-Alaoui-based ones. Conclusions of Section 6 summarize the contributions of this paper.

2. Grünwald-Letnikov Fractional-Order Difference

It is well known [23, 24] that continuous-time fractional-order derivatives of Grünwald-Letnikov and Riemann-Liouville can be discretized at the sampling interval to obtain the (fractional-order) discrete-time derivative (DTD):

where the Grünwald-Letnikov fractional-order difference (FD) in discrete time is described by equation

where is the fractional order, is the backward shift operator, and

with

Remark 1. For brevity, we will proceed with the FD instead of the more general DTD. Whenever substantial, however, we will comment on the effect of on the results to follow.

In [8, 25], truncated or finite fractional difference (FFD) has (in analogy to FIR) been considered for practical, feasibility reasons, with the convergence to zero of the series enabling assuming for some , where is the number of backward signal samples used to calculate the fractional difference. We will further proceed with FFD, to be formally defined below.

Definition 2 (see [8]). Let the fractional difference (FD) be defined as in (2) to (4). Then the finite fractional difference (FFD) is defined as

where and is the upper bound for when .

The FFD has been analyzed in some papers under the heading of a practical implementation of FD [26–28], or a truncated/finite difference [21, 23, 29], or a short-memory difference [30].

Remark 3. It is well known [8] that, equivalent to (2), FD can be rewritten as the limiting FFD (for ) in the form

with for all .

3. Orthonormal Basis Functions

It is well known that an open-loop stable linear discrete-time IIR system governed by the transfer function

where the impulse response ,  , can be described in the Laurent expansion form [31, 32]

including a series of orthonormal basis functions (OBF) and the weighting parameters ,  , characterizing the model dynamics.

Various OBF can be used in (8). Two commonly used sets of OBF are simple Laguerre and Kautz functions. These functions are characterized by the “dominant” dynamics of a system, which is given by a single real pole or a pair of complex ones , respectively. In case of discrete-time Laguerre filters to be exploited hereinafter, the orthonormal functions

with and , consist of a first-order low-pass factor and th-order all-pass filters.

Remark 4. It is important that the factor need not include the sampling interval (which can be set to unity) and this is because the FD components ,  , do not include .

Remark 5. Depending on the domain context, we will use various arguments in , for example, in the -domain and or in the time-domain. The same concerns the arguments in .

Remark 6. Our interest in the Laguerre filters also results from the fact that their well-damped behavior fit the nonoscillatory dynamics of DTD (in addition to a low number of Laguerre model parameters involved).

The coefficients ,  , can be calculated from the scalar product of and [31]:

where   is the complex conjugate of and is the unit circle. Note that and ,  , must be analytic in . It is also possible to calculate the scalar product in the time-domain

where the impulse response of the system ,  ,  ,  , and is the Kronecker delta.

4. Laguerre-Based Fractional-Order Differences

4.1. Laguerre-Based Difference

Let us firstly define a “sort of” a difference to be referred to as the Laguerre-based difference.

Definition 7 (see [16]). Let and ,  , be described as in (8) through (10). Then the Laguerre-based difference (LD) is defined as

with for all .

Remark 8. Again, whenever substantial we will comment on the effect of the sampling period when using an LD-based form of DTD (compare Remark 1). This will also hold true for the forthcoming CFLD and its two approximators FLD and FFLD.

Since in (6) represents a sort of IIR and so does as in (12), the question arises as to what a relationship between and is and, moreover, if and when it is possible to obtain .

Now, a fundamental equivalence result in this respect is recalled.

Theorem 9 (see [16]). Let the FD be defined as in (2) through (4) or, equivalently, as in (6) and let the LD be defined as in Definition 7. Then LD is identical to FD, that is, , if and only if

with , being the dominant Laguerre pole and

4.2. Combined Fractional/Laguerre-Based Difference

Let us finally define a combined fractional/Laguerre-based difference, which is a combination of the “classical” FD and our LD.

Definition 10 (see [16]). Let the FD and LD be defined as in (2) and (12), respectively. Then the combined fractional/Laguerre-based difference (CFLD) is defined as

where

with the first component at the right-hand side of (16) constitutes the FFD share in the CFLD and the second one is the (-delayed) LD share, with ,  , as in (3) and (4), and and ,  , as in (9) and (10), respectively.

Here is another fundamental equivalence result.

Theorem 11 (see [16]). Let the Grünwald-Letnikov fractional difference (FD) be defined as in (2) through (4), the Laguerre-based difference (LD) is as in Definition 7 and the combined fractional/Laguerre-based difference (CFLD) is as in Definition 10. Then CFLD is equivalent to FD in that if and only if

with and   being the dominant Laguerre pole and

Remark 12. Note that regardless of an actual value of we have , in the sense that ,  .

Note that the above-presented fractional-order differences FD, LD, and CFLD may lead to computational explosion. So, in the next section, finite approximations of the above will be considered.

5. Finite Approximations of Fractional-Order Differences

5.1. Finite Fractional Difference

In Section 2, the “classical” finite fractional difference (FFD) has been redefined. In a similar way, we define two finite fractional approximators to LD and CFLD.

5.2. Finite Laguerre-Based Difference

In analogy to the presented finite fractional difference (FFD), the convergence to zero of the series enables assuming for some , where is the number of the Laguerre filters used to calculate the finite LD. We will further proceed with the finite Laguerre-based difference (FLD), to be formally defined below.

Definition 13 (see [16]). Let the Laguerre-based discrete-time difference (LD) be defined as in Definition 7. Then the finite Laguerre-based difference (FLD) is defined as

where is the number of the Laguerre filters used do calculate the difference FLD and ,  , are calculated as in (13).

5.3. Finite Fractional/Laguerre-Based Difference

The idea behind combining FFD and FLD comes from a priori knowledge about the natures of FFD versus FD in the initial (or high-frequency) part of the model [8] and FLD versus classical FIR in the remaining (or medium/low-frequency) part. In fact, for so the “only” problem is to find a “good” and, on the other hand, a “good” number of the Laguerre filters, which is essentially lower than a number of FIR components, in particular in the medium/low frequency part.

Step by step, we arrive at the most practically important model of FD, being the truncated or finite CFLD.

Definition 14 (see [16]). Let the combined fractional/Laguerre-based difference (CFLD) be defined as in Definition 10. Then the finite (combined) fractional/Laguerre-based difference (FFLD) is defined as

where is a number of the Laguerre filters used in the model.

Remark 15. An important problem of selection of the Laguerre pole for FLD and FFLD has been effectively solved in [16, 17].

Remark 16. It is essential that FLD and, in particular, FFLD have been shown to be computationally very effective, in that surprisingly low numbers of and are sufficient to provide very high modeling accuracies [16, 17].

5.4. Tustin- and Al-Alaoui-Based Approximations

There are three most popular discretization schemes for fractional-order derivatives, resulting in two Tustin-based and one Al-Alaoui-based approximators [12, 33–35]. Let us recall the so-called Tustin-Muir approximator, mainly in order to rectify some error frequently repeated in the Muir recursion. The Tustin-Muir approximator is

where ,  , and are the polynomials in of orders , whose coefficients can be computed in a recursive way:

with

and .

For the Al-Alaoui-based approximator there is

where ,  , and are the CFE-related polynomials in of, generally, different orders [12], but we will assume equal orders here.

5.5. Steady-State Error

An important problem encountered in various approximations to FD is an incorrect steady-state gain of the model. This may lead to remarkable steady-state errors in modeling of DTD, the issue being sometimes disregarded, in particular in, for example, the Tustin-based discretization model. Steady-state errors for all the considered models of DTD are characterized below.

Lemma 17. Let the steady-state error for the FLD-based model of DTD with respect to the DTD one be defined as

Then

where is the steady-state value of .

Proof. The steady-state value of the outputs from the Laguerre filters ,  , is given by

Accounting for (1), Remark 8, and Definition 13 and for the fact that , we immediately arrive at (26).

Lemma 18. The steady-state error for FFLD-based model of DTD with respect to the DTD one defined as

is

Proof. It is similar to proof of Lemma 17, with Definition 14 being involved.

Here we have a nice steady-state accuracy result for the FFLD-based model of DTD.

Corollary 19. Let the steady-state errors and , , be defined as in (25) and (28). Then .

Proof. The proof is immediate from Lemmas 17 and 18, taking into account that is always negative [8].

We are in a position now to recall two important theoretical results for LD and CFLD.

Theorem 20 (see [17, 18]). Consider LD as in Definition 7, with ,  , as in (13). Then

Remark 21. It is interesting that, with all the coefficients ,  , depending on , their infinite sum as in (30) is, rather surprisingly, independent of . Of course, the finite sum of those coefficients as in (26) remains dependent on .

Theorem 22 (see [17, 18]). Consider CFLD as in Definition 14, with , , as in (17). Then

Remark 23. For FLD and FFLD, (30) and (31), respectively, are satisfied only approximately due to the finite summations. However, the quality of the FLD and FFLD approximations in the steady state can be assessed from the “closedness” of the right- and left-hand sides of (30) and (31), respectively.

Let us now state a simple steady-state accuracy result for the Tustin-based model of DTD.

Lemma 24. The steady-state error for the Tustin-based discretization model (21) with respect to DTD defined as

is

Proof. It is immediate from (21), with .

Lemma 25. The steady-state error for the Al-Alaoui-based discretization model (24) with respect to DTD defined as

is

Proof. The proof comes immediately from (24), with .

Remark 26. Note that the steady-state error equations (26), (29), (33), and (35) incorporate the factor in the same manner. Therefore, in a comparative analysis we can use, for example, .

Example 27. Recall the steady-state errors as in (26), (29), (33), and (35) for the FLD-, FFLD-, Tustin-, and Al-Alaoui-based approximations to DTD, respectively. The error plots presented in Figure 1 are self-explanatory. The FFLD-based model clearly outperforms the three remaining ones, of which the Tustin-based model is definitely inferior, even for very high approximation orders. Also note how low is, which when increased to, for example, 15 or 20 can contribute to further drop of the error. Also note that the Al-Alaoui approximator cannot be used for the order due to numerical problems, in particular in the Matlab environment.

Figure 1: Steady-state errors for FLD-, FFLD-, Tustin-, and Al-Alaoui-based approximations; Example 27.

Remark 28. It is worth mentioning that the steady-state accuracy issue is very important as even low steady-state approximation errors for the fractional difference may be propagated to high modeling errors for a fractional-order dynamical system [8].

Example 29. Consider the FD-based DTD of order . The FLD- (with ) and FFLD- ( and ) based models are analyzed versus the Tustin-based approximation of order (which is usually considered very high) and the Al-Alaoui-based approximation of order . Figure 2 presents step responses for the DTD and its FLD/FFLD/Tustin/Al-Alaoui-based approximations at the sampling period . The “strange” behavior of the response for the Tustin-based model of DTD is surprising. On the other hand, the responses of DTD and its FLD-, FFLD-, and Al-Alaoui-based approximations are hardly distinguishable, which suggests that a frequency-domain analysis could be welcome here. On the other hand, the mean square prediction errors (MSPE), shown in Table 1, indicate that the time-domain fit of the FFLD-based model of DTD is the best.

Table 1: Mean square prediction error for the analyzed models; Example 29.

Models
MSPE

Al-Alaoui-based Laguerre model

FLD-based Laguerre model

FFLD-based Laguerre model

Figure 2: Step responses for DTD and its FLD-, FFLD-, Tustin-, and Al-Alaoui-based approximations; Example 29.

Remark 30. The “strange” behavior of the step response for the Tustin-based approximation results from the fact that one pole of the transfer function is highly negative (in the range of, e.g., −0.9), which itself may raise doubts on the adequacy of the Tustin-based approximation.

5.6. Frequency-Domain Analysis

Let us start with an instructive simulation example.

Example 31. Consider a fractional-order derivative represented by and its discrete-time approximations as in Example 29. Figure 3 presents Bode plots for the fractional-order derivative and its FLD/FFLD/Tustin-based approximations at the sampling period . In Figure 3, the gray-marked area shows the error from the actual value of in the magnitude spectrum and its equivalent in the phase spectrum , respectively, with the error bound fulfilled within the frequency spectrum and a specific type of the model subindexed as “mod.” Magnitude plots for the FFLD- and FLD-based models are within the error bound over a remarkably wider area of the frequency spectra and , respectively, as compared to the Tustin-based approximation, with . So, in this regard the FFLD and FLD approximations are much more effective than the Tustin-based approach. For lucidity, we refrain from plotting the magnitude characteristic for the Al-Alaoui-based approximator as it is very close to the FLD-based one.
In case of phase plots, the FFLD- and FLD-based models are within the error bound over a remarkably wider area of the frequency spectra and , respectively, as compared to the Tustin-based approximation, with . As for the Al-Alaoui-based approximation, the phase plot is slightly better than the FLD-based one, with , but remarkably worse than the FFLD-one. (Note: for lucidity, we refrain from marking the value as it is very close to and .) Note that the FLD/FFLD/Al-Alaoui-based approximators generate a high phase error for high frequencies (close to the sampling frequency). This phase error is a result of the backward difference based discretization scheme for the continuous-time derivative.
Finally, on the basis of both magnitude and phase plots we obtain adequacy ranges for the FFLD-based model: , Al-Alaoui-based model: , FLD-based model: , and Tustin-based model: . So, the Tustin-based approximation has two times higher upper frequency limit as compared to the FFLD/FLD/Al-Alaoui-based approximations. However, taking into account that the FFLD/FLD/Al-Alaoui-based models include the sampling period in their denominators only, we can easily left/right-shift the frequency spectrum by changing the sampling period . For our FFLD- and FLD-based models we obtain the adequacy ranges and , respectively, whereas for the Al-Alaoui model we have . Therefore, using the sampling period for the FFLD/FLD/Al-Alaoui-based models we obtain the adequacy ranges for FFLD, for FLD, and for the Al-Alaoui model, with the upper frequency bounds being similar to the Tustin-based approximation for . (Note: for lucidity, we refrain from showing both magnitude and phase plots for the FD-based DTD model, with the former one being identical to that for and the latter one being very close to that for at the low and medium frequency ranges and very close to that for the FLD/FFLD-based approximation for high frequencies.)

Figure 3: Bode plots for FLD-, FFLD-, and Tustin-based approximations; Example 31.

Example 31 illustrates that possible high argument errors for the FLD/FFLD-based models in the high frequency range are related to the backward difference argument error which depends on the sampling period . Now, the argument error analysis deserves a special attention. Here we present a new method to calculate this error.

Theorem 32 (main result). Consider an -order continuous-time derivative and its Laplace transform , . Discretize the derivative using the backward difference scheme to obtain the FD-based DTD as in (1) and (2). The frequency-domain argument error for DTD with respect to defined as

is equal to

Proof. It is well known that DTD can be described in the -domain as

Accounting for in the frequency-domain form we obtain

with the latter manipulation using the fact that is the conjugate to . Finally, the argument of is

Now, recalling the definition in (36) and taking into account that we arrive at (37).

5.6.1. Discussion

On the basis of Theorem 32, when we assume the maximum value of modulus of the argument error and the upper bound for frequency range we can immediately select such a sampling period which can guarantee that for ; namely,

It is worth mentioning that the error can be quite high for high frequencies; for example, in the highest frequency range () we obtain . On the other hand, in Example 31 it has been presented that, for high frequency ranges, the results generated by the FLD/FFLD/Al-Alaoui-based approximations are very similar to DTD. Therefore, we can write that for high frequencies we have and we can use (37) and (41) to estimate the sampling period for the FLD/FFLD/Al-Alaoui-based approximations.

Remark 33. It is time now to recall the “noncasual compensator” method for elimination of the phase error in the Al-Alaoui-based approximator [12], which could also be used for the FLD/FFLD-based ones. However, with such an “artificial” phase rectification, we dismiss the original time-domain interpretation (and applications) of the fractional-order derivative/difference. Therefore we claim that our “frequency shifting” method, based on selection of the sampling period , is more practically oriented.

Example 34. Consider the fractional-order derivative and its discrete-time approximations as in Example 31. Figure 4 presents the approximation error defined as for the four particular models, where denotes the FLD-based model (), the FFLD-based model (), the Tustin-based model (), and the Al-Alaoui-based model (). It can be seen from Figure 4 that the Tustin-based approach shows a better performance for high frequencies, except for very high frequencies when tends to . In medium/low frequency ranges, FLD-, Al-Alaoui-, and, particularly, FFLD-based models provide much better results than the Tustin-based approach. This can be illustrated by the aggregate relative error defined as , which, for a set of selected values of , is equal to 13.323 for the FFLD-based, 29.998 for Al-Alaoui-based, 40.577 for FLD-based, and 173.35 for Tustin-based approximations.

Figure 4: Approximation error for FFLD-, FLD-, Tustin-, and Al-Alaoui-based approximations; Example 34.

Example 35. Consider the fractional-order derivative of order . Assume that for we should have the phase error [Rad] (or 10 degrees). On the basis of (41) we have . So if we assume in the FFLD/FLD/Al-Alaoui-based approximations, we obtain . Figure 5 presents Bode plots for the FFLD-based (, ), FLD-based (), and Al-Alaoui-based () models for versus the Tustin-based approximation () using the sampling period . Since the magnitude plots for the FLD- and Al-Alaoui-based models are very close to each other, we show only phase plots for the Al-Alaoui-based approximation.

Figure 5: Bode plots for FLD-, FFLD-, Al-Alaoui-, and Tustin-based approximations; Example 35.

Remark 36. The above examples are only an illustrative selection from a plethora of simulation runs, all of them confirming the above-presented results.

Remark 37. Clearly, the FFLD-based approximation outperforms the three other ones, also in that it covers the fractional-order range , in contrast to the Tustin- and Al-Alaoui-based models.

6. Conclusion

This paper has presented a bunch of original results on modeling of fractional-order discrete-time derivative (DTD) by means of its two Laguerre-based approximators. The FLD- and, in particular, FFLD-based approximators have been shown to substantially outperform another popular approximator, namely, the Tustin-based one but also, in case of FFLD, the Al-Alaoui-based one. New results on steady-state accuracy and, in particular, frequency-domain phase analyses, supported with simulations examples, confirm the usefulness of the considered Laguerre-based approximators, in particular the FFLD one.

Abbreviations

CFE: | Continuous fraction expansion
CFLD: | Combined fractional/Laguerre-based difference
DTD: | Fractional-order discrete-time derivative
FD: | Grünwald-Letnikov fractional-order difference
FFD: | Finite fractional difference
FFLD: | Finite (combined) fractional/Laguerre-based difference
FLD: | Finite Laguerre-based difference
LD: | Laguerre-based difference
OBF: | Orthonormal basis functions.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

References

R. S. Barbosa and J. A. T. Machado, “Implementation of discrete-time fractional- order controllers based on LS approximations,” Acta Polytechnica Hungarica, vol. 3, no. 4, pp. 5–22, 2006.

Y. Chen, B. Vinagre, and I. Podlubny, “A new discretization methodfor fractional order differentiators via continued fraction expansion,” in Proceedings of ASME Design Engineering Technical Conferences (DETC '03), vol. 340, pp. 349–362, Chicago, Ill, USA, 2003.

B. M. Vinagre, I. Podlubny, A. Hernandez, and V. Feliu, “Some approximations of fractional order operators used in control theory and applications,” Fractional Calculus & Applied Analysis, vol. 3, no. 3, pp. 945–950, 2000.

P. J. Kootsookos and R. C. Williamson, “FIR approximation of fractional sample delay systems,” IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, vol. 43, no. 3, pp. 269–271, 1996.

C. X. Jiang, J. E. Carletta, and T. T. Hartley, “Implementation of fractional-order operators on field programmable gate arrays,” in Advances in Fractional Calculus, pp. 333–346, Springer, Dordrecht, The Netherlands, 2007.

C.-C. Tseng, S.-C. Pei, and S.-C. Hsia, “Computation of fractional derivatives using Fourier transform and digital FIR differentiator,” Signal Processing, vol. 80, no. 1, pp. 151–159, 2000.

K. J. Latawiec, R. Stanisławski, W. P. Hunek, and M. Łukaniszyn, “Adaptive finite fractional difference with a time-varying forgetting factor,” in Proceedings of the 17th International Conference on Methods and Models in Automation and Robotics (MMAR '12), pp. 64–69, Miedzyzdroje, Poland, August 2012.

R. Stanisławski and K. J. Latawiec, “Normalized finite fractional differences: computational and accuracy breakthroughs,” International Journal of Applied Mathematics and Computer Science, vol. 22, no. 4, pp. 907–919, 2012.

M. A. Al-Alaoui, “Al-Alaoui operator and the new transformation polynomials for discretization of analogue systems,” Electrical Engineering, vol. 90, no. 6, pp. 455–467, 2008.

M. A. Al-Alaoui, “Simulation and discretization of fractional-order systems,” in Proceedings of the International Conference on Genetics and Evlutionary Methods, pp. 249–255, Las Vegas, Nev, USA, 2009.

M. A. Al-Alaoui, “Class of digital integrators and differentiators,” IET Signal Processing, vol. 5, no. 2, pp. 251–260, 2011.

Y. Q. Chen and K. L. Moore, “Discretization schemes for fractional-order differentiators and integrators,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 49, no. 3, pp. 363–367, 2002.

Y. Chen, B. M. Vinagre, and I. Podlubny, “Continued fraction expansion approaches to discretizing fractional order derivatives–-an expository review,” Nonlinear Dynamics, vol. 38, no. 1–4, pp. 155–170, 2004.

M. Gupta and R. Yadav, “New improved fractional order differentiator models based on optimized digital differentiators,” The Scientific World Journal, vol. 2014, Article ID 741395, 11 pages, 2014.

B. T. Krishna, “Studies on fractional order differentiators and integrators: a survey,” Signal Processing, vol. 91, no. 3, pp. 386–426, 2011.

R. Stanisławski, “New Laguerre filter approximators to the Grünwald-LETnikov fractional difference,” Mathematical Problems in Engineering, vol. 2012, Article ID 732917, 21 pages, 2012.

R. Stanisławski, Advances in Modeling of Fractional Difference Systems—New Accuracy, Stability and Computational Results, vol. 243 of Studia i Monografie, Opole University of Technology Press, Opole, Poland, 2013.

R. Stanislawski, K. J. Latawiec, and M. Lukaniszyn, “The steady-state error issue in Laguerre-based modeling of the GL fractional difference,” in Proceedings of the IEEE 22nd International Symposium on Industrial Electronics (ISIE '13), pp. 1–6, Taipei, Taiwan, May 2013.

Y. Ferdi, “Computation of fractional order derivative and integral via power series expansion and signal modeling,” Nonlinear Dynamics, vol. 46, no. 1-2, pp. 1–15, 2006.

G. Maione, “On the Laguerre rational approximation to fractional discrete derivative and integral operators,” IEEE Transactions on Automatic Control, vol. 58, no. 6, pp. 1579–1585, 2013.

Z. Liao, “A new definition of fractional derivatives based on truncated left-handed Grunwald-Letnikov formula with and mediancorrection,” Abstract and Applied Analysis, vol. 2014, Article ID 914386, 9 pages, 2014.

R. Stanisławski, W. P. Hunek, and K. J. Latawiec, “Finite approximations of a discrete-time fractional derivative,” in Proceedings of the 16th International Conference on Methods and Models in Automation and Robotics (MMAR '11), pp. 142–145, Miedzyzdroje, Poland, August 2011.

C. Monje, Y. Chen, B. Vinagre, D. Xue, and V. Feliu, Fractional-Order Systems and Controls, Springer, London, UK, 2010.

P. Ostalczyk, “Equivalent descriptions of a discrete-time fractional-order linear system and its stability domains,” International Journal of Applied Mathematics and Computer Science, vol. 22, no. 3, pp. 533–538, 2012.

R. Stanislawski, “Identification of open-loop stable linear systems using fractional orthonormal basis functions,” in Proceedings of the 14th International Conference on Methods and Models in Automation and Robotics, pp. 935–985, Miedzyzdroje, Poland, 2009.

M. Buslowicz, “Simple analytic conditions for stability of fractional discrete-time linear systems with diagonal state matrix,” Bulletin of the Polish Academy of Sciences: Technical Sciences, vol. 60, no. 4, pp. 809–814, 2012.

M. Buslowicz and T. Kaczorek, “Simple conditions for practical stability of positive fractional discrete-time linear systems,” International Journal of Applied Mathematics and Computer Science, vol. 19, no. 2, pp. 263–269, 2009.

T. Kaczorek, “Practical stability of positive fractional discrete-time linear systems,” Bulletin of the Polish Academy of Sciences: Technical Sciences, vol. 56, no. 4, pp. 313–317, 2008.

A. Dzieliński and D. Sierociuk, “Stability of discrete fractional order state-space systems,” Journal of Vibration and Control, vol. 14, no. 9-10, pp. 1543–1556, 2008.

I. Podlubny, Fractional Differential Equations, Academic Press, Orlando, Fla, USA, 1999.

P. S. C. Heuberger, P. M. J. van den Hof, and B. Wahlberg, Modelling and Identification with Rational Orthogonal Basis Functions, Springer, London, UK, 2005.

P. M. van den Hof, P. S. Heuberger, and J. Bokor, “System identification with generalized orthonormal basis functions,” Automatica, vol. 31, no. 12, pp. 1821–1834, 1995.

Y. Q. Chen and K. L. Vinagre, “A new IIR-type digital fractional order differentiator,” Signal Processing, vol. 83, no. 11, pp. 2359–2365, 2003.

M. Siami, M. Saleh Tavazoei, and M. Haeri, “Stability preservation analysis in direct discretization of fractional order transfer functions,” Signal Processing, vol. 91, no. 3, pp. 508–512, 2011.

B. M. Vinagre, Y. Q. Chen, and I. Petráš, “Two direct Tustin discretization methods for fractional-order differentiator/integrator,” Journal of the Franklin Institute. Engineering and Applied Mathematics, vol. 340, no. 5, pp. 349–362, 2003.