Parallel modeling and structure of nonlinear Volterra discrete systems

Abstract

A parallel modeling of the nonlinear finite extent Volterra discrete systems, which exploits the inherent symmetries and ensures fast implementation and design with the minimum computational and hardware cost, is presented. The parallel realization model is based on the successive decomposition of the kth order Volterra kernel in terms of lower order kernels, which are ordered in sequential nested subkernels. The resulting parallel realization is a tree structure with inputs the associated quadratic Volterra kernels. Each layer of the tree structure is comprised of nodes that represent the kernels of the same order and can be computed independently and simultaneously. The proposed parallel model is characterized by a great degree of modularity and regularity, since it uses only planar triangular arrays and local communications, and constitutes the basis for efficient fast implementations using VLSI array processors.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>