Showing papers on "Parallel algorithm published in 1972"
TL;DR: A parallel FFT algorithm is described that segments the fast Fourier transform algorithm into groups of identical parallel operations that can be performed concurrently and independently.
Abstract: For many real-time signal processing problems, correlations, convolutions, and Fourier analysis must be performed in special-purpose digital hardware. At relatively high levels of performance, it becomes necessary for this hardware to perform some of its computations in parallel. A parallel FFT algorithm is described that segments the fast Fourier transform algorithm into groups of identical parallel operations that can be performed concurrently and independently. A hardware implementation of the algorithm is described in the context of the parallel element processing ensemble (PEPE) previously described by Githens [7], [8].
19 citations
TL;DR: An algorithm is described based on Newton's method which simultaneously approximates all zeros of a polynomial with only real zeros, and determines its own starting values so that convergence to the zeros is guaranteed.
Abstract: An algorithm is described based on Newton's method which simultaneously approximates all zeros of a polynomial with only real zeros. The algorithm, which is conceptually suitable for parallel computation, determines its own starting values so that convergence to the zeros is guaranteed. Multiple zeros and their multiplicity are readily determined. At no point in the method is polynomial deflation used.
10 citations
01 Sep 1972
TL;DR: It is shown how the estimation problem can be reformulated so as to use parallel computers effectively to approximate the optimal state estimate of the conditional mean estimate for nonlinear dynamical systems.
Abstract: : The paper describes different parallel algorithms for computing the conditional mean estimate for nonlinear dynamical systems. It is shown how the estimation problem can be reformulated so as to use parallel computers effectively to approximate the optimal state estimate. The problem of quantization, which plays an important role in numerical approximation, is considered. An optimal wide-sense quantizer is obtained which can be realized by simple hardware. The parallel algorithms described in the paper are suitable for a large class of parallel computers. (Author)
4 citations