No abstract

No abstract

No abstract

We consider the representation and identification of nonlinear systems through the use of parallel cascades of alternating dynamic linear and static nonlinear elements. Building on the work of Palm and others, we show that any discrete-time finite-memory nonlinear system having a finite-order Volterra series representation can be exactly represented by a finite number of parallel LN cascade paths. Each LN path consists of a dynamic linear system followed by a static nonlinearity (which can be a polynomial). In particular, we provide an upper bound for the number of parallel LN paths required to represent exactly a discrete-time finite-memory Volterra functional of a given order. Next, we show how to obtain a parallel cascade representation of a nonlinear system from a single input-output record. The input is not required to be Gaussian or white, nor to have special autocorrelation properties. Next, our parallel cascade identification is applied to measure accurately the kernels of nonlinear systems (even those with lengthy memory), and to discover the significant terms to include in a nonlinear difference equation model for a system. In addition, the kernel estimation is used as a means of studying individual signals to distinguish deterministic from random behaviour, in an alternative to the use of chaotic dynamics. Finally, an alternate kernel estimation scheme is presented.

We describe and illustrate methods for obtaining a parsimonious sinusoidal series representation or model of biological time-series data. The methods are also used to identify nonlinear systems with unknown structure. A key aspect is a rapid search for significant terms to include in the model for the system or the time-series. For example, the methods use fast and robust orthogonal searches for significant frequencies in the time-series, and differ from conventional Fourier series analysis in several important respects. In particular, the frequencies in our resulting sinusoidal series need not be commensurate, nor integral multiples of the fundamental frequency corresponding to the record length. Freed of these restrictions, the methods produce a more economical sinusoidal series representation (than a Fourier series), finding the most significant frequencies first, and automatically determine model order. The methods are also capable of higher resolution than a conventional Fourier series analysis. In addition, the methods can cope with unequally-spaced or missing data, and are applicable to time-series corrupted by noise. Finally, we compare one of our methods with a well-known technique for resolving sinusoidal signals in noise using published data for the test time-series.