Complexity

Volume 2017, Article ID 3452409, 11 pages

https://doi.org/10.1155/2017/3452409

## Generalized Fractional-Order Discrete-Time Integrator

^{1}Faculty of Computer Science, Bialystok University of Technology, Białystok, Poland^{2}Institute of Applied Computer Science, Lodz University of Technology, Łódź, Poland

Correspondence should be addressed to Dorota Mozyrska; lp.ude.bp@aksryzom.d

Received 10 February 2017; Accepted 23 April 2017; Published 6 July 2017

Academic Editor: Ahmad T. Azar

Copyright © 2017 Dorota Mozyrska and Piotr Ostalczyk. 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

We investigate a generalization of discrete-time integrator. Proposed linear discrete-time integrator is characterised by the variable, fractional order of integration/summation. Graphical illustrations of an analysis of particular vector matrices are presented. In numerical examples, we show relations between the order functions and element responses.

#### 1. Introduction

In order to build a dynamic system, one should define specifications to be met, apply synthesis techniques, if available, analyse a mathematical model of a system, and simulate the model on a computer to test the effect of various inputs on the behavior of the resulting system. New classes and categories of systems that could be used as new models are still needed. One of the most important tools is an element called “integrator.” In measurements and control applications, an integrator is an element whose output signal is the time integral (in continuous case) or summation (in discrete case) of its input signal. It accumulates the input quantity over a defined time to produce a representative output. For the classical theory, see, for instance, [1, 2]. An integrator may be treated as a fundamental and is commonly used in constructions of more complicated systems via Kelvin’s scheme [2]. This leads to a variety of structures known as realizations. As crucial realizations, those, which reveal such important dynamic properties as stability, controllability, and so forth, are considered. The first-order differential equations can be generalized to the fractional-order ones [3–10]. Hence, we get the fractional-order integrator, which can be used in a modelling of fractional-order dynamic systems.

For discrete-time systems, an equivalent element is called a summator or discrete integrator. This dynamic element is described by linear time-invariant first-order difference equation; see [11, 12]. As a generalization of the classical discrete integrator, we can consider discrete summation of fractional order [3, 13–20]. In this paper, we propose a generalization of the fractional-order discrete integrator and call it the variable-, fractional-order discrete-time integrator.

Besides applications of integrators in mentioned realizations, another important use is the integration action in the PID controllers; see [1, 21]. The integration action preserves a zero steady state in the closed-loop systems with typical plants. Different types of the variable-, fractional-order elements have been proposed in [22, 23]. For constant orders (fractional or integer orders), all integrators are identical. This property is not valid in the variable-, fractional-order integrators in the mentioned types. Comparing with the model of integrator described in [22], we state here a different and more general model with better motivated initial conditions. Moreover, our investigations of values of coefficients of matrices, that are used for calculations of models, are much more advanced.

The proposed integrator may be used in the variable-, fractional-order digital filters [11, 12], described by related variable-, fractional-order difference equations. In the paper, an equivalent but very useful vector matrix description of the variable-, fractional-order integrator is applied. It becomes a great tool in the variable-, fractional-order integrators description. One should mention that to variable-, fractional-order difference equations we cannot apply the -transform.

The paper is organised as follows. After an introduction to the variable-, discrete-, fractional-order calculus, a description of the variable-, fractional-order discrete integrator is given in Section 3. The formula for the variable-, fractional-order integrator response is derived. Our investigations are illustrated by numerical examples.

#### 2. Preliminaries

The most important in the evaluation of the variable-, fractional-order backward difference/sum is the kernel function, named after its action the* oblivion function*. For and a given order function , the function of two discrete variables is defined by its values: . We assume that order functions have values in the interval .

*Definition 1. *For and a given order function , one defines the oblivion function, as a discrete function of two variables, by its values given as

It is easy to observe that for opposite values of order function holds the following:

Formula (1) in Definition 1 is equivalent to the following recurrence with respect to :

In [24], we have proved the following properties for positive values of order function.

Proposition 2 (see [24]). *Let the order function have values for . Then, the following properties hold: **(a)**For all and , .**(b)**For all , the sequence is increasing.**(c)**For each increasing and bounded order function with values in and for each , there is such that for the sequence is increasing; that is, for ,* *Particularly for order functions with values in , the border .**(d)**For each increasing and bounded order function with values in , there is such that for *

*In the sequel, we need to prove parallel properties for oblivion function with negative values of order function with values for .*

*Proposition 3. Let one assume that, , . Then the following properties are satisfied: (a)For all and , .(b)For all , the sequence is decreasing.(c)For decreasing and bounded order function with values in and for each , the sequence is decreasing; that is, for ,(d)For decreasing and bounded order function with values in and for each holds*

*Proof. *For , we have that and for Then, we directly have points (a), (b), and (c). In (b), we need additionally to notice that , which gives . We do the next calculations to receive what we claim in point (d). We have the following: Moreover, as , then for . Knowing that , we receive . Hence,and then from point (c) we have the thesis.

*In the next definition, the Grünwald–Letnikov fractional-order backward difference (GL-FOBD) is generalized to the Grünwald–Letnikov variable-, fractional-order backward difference (GL-VFOBD) in part (a) and to the Grünwald–Letnikov variable-, fractional-order backward difference with initialization (GL-VFOBDwI) in part (b). For definition and properties of the Grünwald–Letnikov fractional-order backward difference (GL-FOBD) for constant order, we refer to [10, 18, 25, 26].*

*Definition 4. *Let be a discrete-variable bounded real valued function.(a)The Grünwald–Letnikov variable-, fractional-order backward difference with initialization (GL-VFOBDwI) with an order function is defined as an infinite sum, provided that the series is convergent:(b)The Grünwald–Letnikov variable-, fractional-order backward difference (GL-VFOBD) with an order function started at is defined as a finite sum

* For , the GL-VFOBD becomes a discrete convolution: , where . In particular case of constant order function, we have the following (for and can be finite or ):(i);(ii);(iii), if only the summation exists.*

*Next, one assumes that for . Equality (11) is defined for any , so it is also valid for any .*

*Collecting all such equalities like (11) in one vector matrix form, one obtainswhere*

*Inside matrix (15) we extract the following parts:*

*For and , appropriate matrices have the following forms:*

*Moreover, it is worth noticing that , which is the -dimensional identity matrix.*

*We give now the series of properties of finite dimensional matrices and and their inverses, for order function with values .*

*Proposition 5 (see [24]). Assume that for all , and for . Then, all elements of the inverse matrix are nonnegative.*

*Proposition 6 (see [24]). For an order function and a constant order , the following equality holds: *

*By direct calculations, one can check that . Proposition 6 confirms the fact that for , we have As a consequence of the last equality, one has the following By direct calculations, we can check thatThe crucial matrix in the VFODI response is . We prove the following in [22].*

*Proposition 7 (see [22]). For order functions with values for , all elements of the matrix are nonnegative.*

*Proposition 8 (see [22]). For two order functions with values , for , all elements of the matrix are less than or equal to these of the matrix ; that is, .*

*3. Variable-, Fractional-Order Difference Integrator (VFODI)*

*3. Variable-, Fractional-Order Difference Integrator (VFODI)*

*3.1. Description of the VFODI*

*3.1. Description of the VFODI*

*Let be the given function and be given bounded function of two variables. Let . The variable-, fractional-order discrete-time difference equation for the pair of orders is described by the following fractional-order difference equation:with initial conditionsand values for .*

*From definitions of fractional operators, (21) has the following recurrence solution:In the simplest situations, we present solutions given by (23) in the form (i)for , and this looks like classical difference equation;(ii)for , and this is the case of the so-called nabla operator equation;(iii)for , ;(iv)for , *

*In the next definition of variable-, fractional-order difference integrator (VFODI), we assume that . Let us introduce the following notation:If , then we can write in the following way *

*The variable-, fractional-order difference integrator (VFODI) is described by the following fractional-order difference matrix-vector equation:with initial condition On the right side of (25), we use finite matrix as on the left side there is a rectangular (finite rows and infinite columns) matrix operator. It is because we claim as in the classical cases that values for . Then, even if we write infinite operator matrix on the right side, it will give the same action as multiplication by an infinite number of zeros of .*

*Proposition 9. Equation (25) with initial condition has the solution given by the following description:*

*Proof. *The proof follows from the fact that taking into account the initial conditions vector and the partition of the matrices , we have from (25)It is possible as matrices and are always nonsingular.

*For example, for and zero initial conditions vector with , we have that Hence, and .*

*Proposition 10. The VFODI of form (25) with fractional orders satisfying the condition that for each , and zero initial conditions vector is a classical first-order summator (discrete-time integrator).*

*Proof. *By the assumption , thenBased on investigations in [24], we know that (29) is equivalent toMatrix is always nonsingular as an upper triangular matrix with ones on the main diagonal. Hence, from (30) one immediately gets and equivalentlyMatrix has the form (19). From the first row of (31) with (19), one obtains or equivalently

*Example 11. *In the numerical example, usefulness of the VFODI is presented. In the first one, the discrete unit step responses of the VFODI for assumed fractional-order function are presented. In the second example, some particular application of the VFODI is shown.

Let us consider two fractional-order functions given by their values for :In Figure 1, plots of order functions , black line, and , red line, are presented. As a consequence in Figures 2(a) and 2(b), images and 3D matrix values are presented.

In Figures 3(a) and 3(b), images and 3D matrix values of are presented, where are pixels positions and are the color representations.

The image and values of matrix are given in Figures 4(a) and 4(b).