Results 231 to 240 of about 468,310 (277)
Some of the next articles are maybe not open access.
1975
The main objective of this chapter is to develop a fast algorithm for efficient computation of the DFT. This algorithm, called the fast Fourier transform (FFT), significantly reduces the number of arithmetic operations and memory required to compute the DFT (or its inverse).
Nasir Ahmed, Kamisetty Ramamohan Rao
openaire +1 more source
The main objective of this chapter is to develop a fast algorithm for efficient computation of the DFT. This algorithm, called the fast Fourier transform (FFT), significantly reduces the number of arithmetic operations and memory required to compute the DFT (or its inverse).
Nasir Ahmed, Kamisetty Ramamohan Rao
openaire +1 more source
1992
It should be stated immediately that a fast Fourier transform (FFT) is not a ‘new transform’ but is an algorithm for the efficient calculation of the discrete Fourier transform. There are many such methods.
openaire +1 more source
It should be stated immediately that a fast Fourier transform (FFT) is not a ‘new transform’ but is an algorithm for the efficient calculation of the discrete Fourier transform. There are many such methods.
openaire +1 more source
The Partial Fast Fourier Transform
Journal of Scientific Computing, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bowman, John C., Ghoggali, Zayd
openaire +2 more sources
A PARALLEL FAST FOURIER TRANSFORM
International Journal of Modern Physics C, 1999In this paper we discuss the general problem of implementing the multidimensional Fast Fourier Transform algorithm on parallel computers. We show that, on a machine with P processors and fully parallel node communications, the optimal asymptotic scaling behavior of the total computational time with the number of data points, N, given in d dimensions ...
Morante, Silvia +2 more
openaire +1 more source
Diskrete Fourier-Transformation und Fast Fourier Transform
2017Handelt es sich bei der Zeitfunktion x = x(t) um eine analytisch nicht darstellbare Funktion, lasst sich die Fourier-Transformation nur numerisch bewerkstelligen. Voraussetzung ist, dass x(t) eine periodische Funktion ist (Abb. 33.1). Handelt es sich bei x(t) um eine aperiodische Funktion, gelingt nur eine Naherung, indem eine fiktive Periode T ...
Christian Petersen, Horst Werkle
openaire +1 more source
Multidimensional Fourier interpolation and fast Fourier transforms
Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâThe equality of the coefficients of the interpolation polynomial over a parallelepipedal grid for a multidimensional function to the coefficients of the interpolation polynomial over a uniform grid for a one-dimensional function is proved, for which the fast Fourier transform can be applied according to various schemes.
Basalov, Yu. A. +2 more
openaire +2 more sources
Assessing fast Fourier transform algorithms
Computational Statistics & Data Analysis, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Microbial volatile organic compounds in intra-kingdom and inter-kingdom interactions
Nature Reviews Microbiology, 2021Laure Weisskopf +2 more
exaly