#### Abstract

This paper proposes a parameter and state estimator for canonical state space systems from measured input-output data. The key is to solve the system state from the state equation and to substitute it into the output equation, eliminating the state variables, and the resulting equation contains only the system inputs and outputs, and to derive a least squares parameter identification algorithm. Furthermore, the system states are computed from the estimated parameters and the input-output data. Convergence analysis using the martingale convergence theorem indicates that the parameter estimates converge to their true values. Finally, an illustrative example is provided to show that the proposed algorithm is effective.

#### 1. Introduction

Parameter estimation and identification have had important applications in system modelling, system control, and system analysis [1–5] and thus have received much research attention in recent decades [6–11]. Several identification methods have been developed for state space models, for example, the subspace identification methods [12]. Gibson and Ninness presented a robust maximum-likelihood estimation for fully parameterized linear time-invariant (LTI) state space models; the idea is to use the expectation maximization (EM) algorithm to estimate maximum-likelihood degrees [13]. Raghavan et al. studied the EM-based state space model identification problems with irregular output sampling [14].

The state space model includes not only the unknown parameter matrices/vectors, but also the unknown noise terms in the formation vector and unmeasurable state vector. Many algorithms can estimate the system states assuming that the system parameter matrices/vectors are available but such state estimation algorithm cannot work if the system parameters are unknown [15]. Recently, Ding presented a combined state and least squares parameter estimation algorithm for dynamic systems [16].

In the area of state space model identification, Ding and Chen proposed a hierarchical identification estimation algorithm for estimating the system parameters and states [17]. Li et al. assumed that the system states were available and used the measurable states and input-output data to estimate the parameters of lifted state space models for general dual-rate systems [18]. Recently, some identification methods have been developed, for example, the least squares methods [19, 20], the gradient-based methods [21, 22], the bias compensation methods [23, 24], and the maximum likelihood methods [25–30]. The objective of this paper is to present a new parameter and state estimation-based residual algorithm from the given input-output data and further to analyze the convergence of the proposed algorithm.

The convergence analysis of identification algorithms has always been one of the important projects in the field of control. By using the stochastic martingale theory, Ding et al. studied the properties of stochastic gradient identification algorithms under weak conditions [31]. Ding and Liu discussed the gradient-based identification approach and convergence for multivariable systems with output measurement noise [32]. Other identification methods for linear or nonlinear systems [33–42] include the auxiliary model identification methods [43–57], the hierarchical identification methods [58–73], and the two-stage or multistage identification methods [74–78].

This paper is organized as follows. Section 2 introduces the system description and its identification model paper. Section 3 derives a basic parameter identification algorithm for canonical state space systems and analyzes the performance of the proposed algorithm. Section 4 gives a state estimation algorithm. Section 5 provides an example for the proposed algorithm. Finally, concluding remarks are given in Section 6.

#### 2. System Description and Identification Model

Let us introduce some notation [15]. “” or “” stands for “ is defined as ”; the symbol stands for an identity matrix of appropriate size ; the superscript denotes the matrix transpose; represents the determinant of a square matrix ; the norm of a matrix is defined by ; represents an vector whose elements are all ; represents the minimum eigenvalues of ; for , we write if there exists a positive constant such that .

In order to study the convergence of the algorithm proposed in [15], here we simply give that algorithm in [15]. Consider a linear system described by the following observability canonical state space model [15]: where is the state vector, is the system input, is the system output, and is a random noise with zero mean. Assume that the order is known, and , and for .

The system in (1) is an observability canonical form, and its observability matrix is an identity matrix; that is,

For the system in (1), the objective of this paper is to develop a new algorithm to estimate the parameter matrix/vector and (i.e., the parameters and ) and the system state vector from the available measurement input-output data .

Since the available measurement input-output data are known but the state vector is unknown, it is required to eliminate the state vector from (1) and obtain a new expression which only involves the input and output, in order to obtain the estimates of the parameters in (1). The following derives the identification model based on the method in [15].

Define some vectors/matrix, From (1), we have Combining (5) with (8) gives or Define the parameter vector and the information vector as Substituting (11) into (9) gives Replacing in (13) with yields which is called the identification model or identification expression of the state-space model.

#### 3. The Parameter Estimation Algorithm and Its Convergence

The recursive least squares algorithm for estimating is expressed as This algorithm is commonly used for convergence analysis. To avoid computing the matrix inversion, this algorithm is equivalently expressed as where is the gain vector.

Define the parameter estimation error vector and the nonnegative function .

Theorem 1. *For the system in (1) and algorithm in (15)–(18), assume that is a martingale difference sequence defined on a probability space , where is the algebra sequence generated by the observations up to and including time . The noise sequence satisfies the following assumptions: *(A1)*, a.s.,*(A2)*, a.s.,*(A3)* is strictly positive real.**Then the following inequality holds:
**
where
*

*Proof. *Define the innovation vector . Using (17), it follows that
Subtracting from both sides of (15) and using (14), we have
According to the definition of and using (16) and (29), we have
Using (26), (27), and (29), and , we have
Since , , are uncorrelated with and are -measurable, taking the conditional expectation with respect to and using (A1)-(A2) give
The state space model in (1) can be transformed into an input-output representation,
where is the adjoint matrix of , and are polynomials in a unit backward shift operator , and
Referring to the proof of Lemma 3 in [43], using (33), we have
Using (17), (26), and (35), from (27), we get
Since is a strictly positive real function, referring to Appendix C in [79], we can obtain the conclusion . Adding both sides of (32) by gives the conclusion of Theorem 1.

Theorem 2. *For the system in (1) and the algorithm in (15)–(18), assume that (A1)–(A3) hold and that is stable; that is, all zeros of are inside the unit circle; then the parameter estimation error satisfies
*

*Proof. *Using the formula , and from the definition of , we have
Let
Since is nondecreasing, using Theorem 1 yields
Referring to the proof of Theorem 2 in [43], we have

Assume that there exist positive constants , , , and such that the following generalized persistent excitation condition (unbounded condition number) holds: Then for any , we have

#### 4. The State Estimation Algorithm

Referring to the method in [15], the state estimate of the state vector can be expressed as To summarize, we list the steps involved in the algorithm in (19)–(23) and (44)–(51) to compute the parameter estimate and the state estimate .

(1)Let ; set the initial values , , , , , or for , . Give a small positive number .(2)Collect the input-output data and ; form using (23), using (45), and using (46).(3)Compute the gain vector using (20) and the covariance matrix using (21).(4)Update the parameter estimation vector using (19).(5)Compute using (22), and form using (47).(6)Determine using (51) and compute using (49); then form using (48).(7)Compute the state estimate using (44).(8)If they are sufficiently close, if , then terminate the procedure and obtain the estimate ; otherwise, increase by 1 and go to step 2.#### 5. Example

Consider the following single-input single-output second-order system in canonical form: The simulation conditions are the same as in [15]. That is, the input is taken as an independent persistent excitation signal sequence with zero mean and unit variances and as a white noise sequence with zero mean and variances and , respectively. Apply the proposed parameter and state estimation algorithm in (19)–(23) and (44)–(51) to estimate the parameters and states of this example system; the parameter estimates and their estimation errors are shown in Tables 1 and 2; the parameter estimation errors versus are shown in Figure 1; the states and their estimates versus are shown in Figures 2 and 3, where () is the parameter estimation error.

From the simulation results of Tables 1 and 2 and Figures 1–3, we can draw the following conclusions.(1)A lower noise level leads to a faster rate of convergence of the parameter estimates to the true parameters.(2)The parameter estimation errors become smaller (in general) as the data length increases; see Tables 1 and 2 and Figure 1. In other words, increasing data length generally results in smaller parameter estimation errors.(3)The state estimates are close to their true values with increasing; see Figures 2 and 3. These indicate that the proposed parameter and state estimation algorithm are effective.

#### 6. Conclusions

In this paper, the identification problems for linear systems based on the canonical state space models with unknown parameters and states are studied. A new parameter and state estimation algorithm has been presented directly from input-output data. The analysis using the martingale convergence theorem indicates that the proposed algorithms can give consistent parameter estimation. The simulation results show that the proposed algorithms are effective. The method in this paper can combine the multiinnovation identification methods [80–92], the iterative identification methods [93–100], and other identification methods [101–111] to present new identification algorithms or to study adaptive control problems for linear or nonlinear, single-rate or dual-rate, scalar or multivariable systems [112–117].

#### Conflict of Interests

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

#### Acknowledgments

This work was supported by the PAPD of Jiangsu Higher Education Institutions and the 111 Project (B12018).