a recursive-circulant $g(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$g(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties. $g(n; d)$ has a recursive structure when $n = cd^m$,$1 leq c < d $ [10]. in this paper, we will find the automorphismgroup of some classes of recursive-circulant graphs. in particular, wewill find that the autom...

A principle mission at the NAS facility is to establish highly parallel computer systems supporting full scale production use by 1996. In order to fulfill this objective, parallel systems must support high speed scalable I/O -suitable for handling output of large scale numerical aerodynamic simulation. Pursuant to this goal, we seek to execute an 'out of core' radix 2 Fast Fourier Transform (FF...

In this paper we analyze the performance of a recursive and an iterative Fast Fourier Transform algorithm, written in Id and run on MINT, a simulator for the Monsoon dataaow machine. Our complexity measures are: the number of instructions executed, the critical path length of the dataaow graph, and the storage occupancy. Using a set of simple functions , we calibrate loop and divide-and-conquer...

The applicability of approximate NARX models of non-linear dynamic systems is discussed. The models are obtained by a new version of Fourier analysis-based neural network also described in the paper. This constitutes a reformulation of a known method in a recursive manner, i.e. adapted to account for incoming data on-line. The method allows us to obtain an approximate model of the non-linear sy...

We consider Shannon sampling theory for sampling sets which are unions of shifted lattices. These sets are not necessarily periodic. A function f can be reconstructed from its samples provided the sampling set and the support of the Fourier transform of f satisfy certain compatibility conditions. While explicit reconstruction formulas are possible, it is most convenient to use a recursive algor...

Kernels of a so-called α-scale space ( 12 < α < 1) have the undesirable property that there is no closed-form representation in the spatial domain, despite their simple closedform expression in the Fourier domain. This obstructs a spatial convolution or recursive implementation. For this reason an approximation of the 2D α-kernel in the spatial domain is presented using the well known Gaussian ...

A quantum compiler is a software program for decomposing (“compiling”) an arbitrary unitary matrix into a sequence of elementary operations (SEO). Coppersmith showed that the NB-bit Discrete Fourier Transform matrix UFT can be decomposed in a very efficient way, as a sequence of order(NB ) elementary operations. Can a quantum compiler that doesn’t know a priori about Coppersmith’s decomposition...