On velocity-based local model networks for nonlinear identification

This paper exposes the strengths and weaknesses of the recently proposed velocity-based local model (LM) network. The global dynamics of the velocity-based blended representation are directly related to the dynamics of the underlying local models, an important property in the design of local controller networks. Furthermore, the sub-models are continuous-time and linear providing continuity with established linear theory and methods. This is not true for the conventional LM framework, where the global dynamics are only weakly related to the affine sub-models. In this paper, a velocity-based multiple model network is identified for a highly nonlinear dynamical system. The results show excellent dynamical modelling performances, highlighting the value of the velocity-based approach for the design and analysis of LM based control. Three important practical issues are also addressed. These relate to the blending of the velocity-based local models, the use of normalised Gaussian basis functions and the requirement of an input derivative.

Constructing networks of continuous-time velocity-based models

A conventional local model (LM) network consists of a set of affine local models blended together using appropriate weighting functions. Such networks have poor interpretability since the dynamics of the blended network are only weakly related to the underlying local models. In contrast, velocity-based LM networks employ strictly linear local models to provide a transparent framework for nonlinear modelling in which the global dynamics are a simple linear combination of the local model dynamics. A novel approach for constructing continuous-time velocity-based networks from plant data is presented. Key issues including continuous-time parameter estimation, correct realisation of the velocity-based local models and avoidance of the input derivative are all addressed. Application results are reported for the highly nonlinear simulated continuous stirred tank reactor process.

Analysis procedure for calculation of electron energy distribution functions from incoherent Thomson scattering spectra

Incoherent Thomson scattering (ITS) provides a nonintrusive diagnostic for the determination of one-dimensional (1D) electron velocity distribution in plasmas. When the ITS spectrum is Gaussian its interpretation as a three-dimensional (3D) Maxwellian velocity distribution is straightforward. For more complex ITS line shapes derivation of the corresponding 3D velocity distribution and electron energy probability distribution function is more difficult. This article reviews current techniques and proposes an approach to making the transformation between a 1D velocity distribution and the corresponding 3D energy distribution. Previous approaches have either transformed the ITS spectra directly from a 1D distribution to a 3D or fitted two Gaussians assuming a Maxwellian or bi-Maxwellian distribution. Here, the measured ITS spectrum transformed into a 1D velocity distribution and the probability of finding a particle with speed within 0 and given value v is calculated. The differentiation of this probability function is shown to be the normalized electron velocity distribution function. (C) 2003 American Institute of Physics.

Self-affine crossover length in a layered silicate deposit

Self-affine dehydrated colloidal deposits on fresh mica surfaces of the synthetic layered silicate 2:1 smectite clay laponite have been studied by means of atomic force microscopy (AFM). AFM images of these prepared assemblies of sol and gel aggregates have been analyzed both by means of standard AFM Fourier software and a wavelet method. The deposited surfaces show a persistence to antipersistent crossover with a clay concentration dependent crossover length. It is concluded that the crossover length is associated with aggregate size, and further that the persistent roughness at small length scales signals near compact clusters of fractal dimension three, whereas the antipersistent roughness at large length scales signals a sedimentation process.

Hierarchical synthesis of complex DSP functions on FPGAs

SoC systems are now being increasingly constructed using a hierarchy of subsystems or silicon Intellectual Property (IP) cores. The key challenge is to use these cores in a highly efficient manner which can be difficult as the internal core structure may not be known. A design methodology based on synthesizing hierarchical circuit descriptions is presented. The paper employs the MARS synthesis scheduling algorithm within the existing IRIS synthesis flow and details how it can be enhanced to allow for design exploration of IP cores. It is shown that by accessing parameterised expressions for the datapath latencies in the cores, highly efficient FPGA solutions can be achieved. Hardware sharing at both the hierarchical and flattened levels is explored for a normalized lattice filter and results are presented.