Identification of Wiener systems with binary-valued output observations

  • Authors:

  • Yanlong Zhao;Le Yi Wang;G. George Yin;Ji-Feng Zhang

  • Affiliations:

  • Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China;Department of Electrical and Computer Engineering, Wayne State University, Detroit, MI 48202, USA;Department of Mathematics, Wayne State University, Detroit, MI 48202, USA;Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China

  • Venue:
  • Automatica (Journal of IFAC)
  • Year:
  • 2007

Quantified Score

Hi-index 22.15

Visualization

Abstract

This work is concerned with identification of Wiener systems whose outputs are measured by binary-valued sensors. The system consists of a linear FIR (finite impulse response) subsystem of known order, followed by a nonlinear function with a known parametrization structure. The parameters of both linear and nonlinear parts are unknown. Input design, identification algorithms, and their essential properties are presented under the assumptions that the distribution function of the noise is known and the nonlinearity is continuous and invertible. It is shown that under scaled periodic inputs, identification of Wiener systems can be decomposed into a finite number of core identification problems. The concept of joint identifiability of the core problem is introduced to capture the essential conditions under which the Wiener system can be identified with binary-valued observations. Under scaled full-rank conditions and joint identifiability, a strongly convergent algorithm is constructed. The algorithm is shown to be asymptotically efficient for the core identification problem, hence achieving asymptotic optimality in its convergence rate. For computational simplicity, recursive algorithms are also developed.