Journal ArticleDOI
UNIDFT: A package of optimized discrete fourier transforms
Reads0
Chats0
TLDR
A package of FORTRAN 77 subprograms to compute the discrete Fourier transform of one-dimensional data sets using a large collection of specialized modules, assembled in a top-down scheme, guarantees high flexibility and efficiency.About:
This article is published in Computer Physics Communications.The article was published on 1987-10-01. It has received 3 citations till now. The article focuses on the topics: Discrete-time Fourier transform & Discrete Fourier transform.read more
Citations
More filters
Journal ArticleDOI
Programs for signal recovery from noisy data using the maximum likelihood principle I. General description
TL;DR: In this paper, a program package for nonnegative signal recovery from noisy experimental data distorted by the measuring device is presented, which allows the maximum value of resolution enhancement according to Shannon's information theory to be achieved.
Journal ArticleDOI
Artificial intelligence techniques in the analysis of digital seismograms
TL;DR: The current prototype SNA2 is able to give correct interpretations in about 90% of situations, thanks to the cooperation of knowledge from independent domains, as are time-series analysis and seismology.
References
More filters
Journal ArticleDOI
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley,John W. Tukey +1 more
TL;DR: Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.
The fast Fourier Transform
TL;DR: A computer algorithm that computes the discrete Fourier transform much faster than other algorithms, is explained and examples and detailed procedures are provided to assist the reader in learning how to use the algorithm.
Journal ArticleDOI
On computing the discrete Fourier transform
TL;DR: New algorithms for computing the Discrete Fourier Transform of n points are described, which use substantially fewer multiplications than the best algorithm previously known, and about the same number of additions.
Journal ArticleDOI
An algorithm for computing the mixed radix fast Fourier transform
TL;DR: This paper presents an algorithm for computing the fast Fourier transform, based on a method proposed by Cooley and Tukey, and includes an efficient method for permuting the results in place.