[图书][B] The fast Fourier transform
HJ Nussbaumer, HJ Nussbaumer - 1982 - Springer
The object of this chapter is to briefly summarize the main properties of the discrete Fourier
transform (DFT) and to present various fast DFT computation techniques known collectively …
transform (DFT) and to present various fast DFT computation techniques known collectively …
Fast algorithms for the multidimensional discrete Fourier transform
A Guessoum, R Mersereau - IEEE transactions on acoustics …, 1986 - ieeexplore.ieee.org
In this paper, the prime factor algorithm for the evaluation of a one-dimensional discrete
Fourier transform is generalized to the evaluation of multidimensional discrete Fourier …
Fourier transform is generalized to the evaluation of multidimensional discrete Fourier …
Fast computation of discrete Fourier transforms using polynomial transforms
H Nussbaumer, P Quandalle - IEEE Transactions on Acoustics …, 1979 - ieeexplore.ieee.org
Polynomial transforms, defined in rings of polynomials, have been introduced recently and
have been shown to give efficient algorithms for the computation of two-dimensional …
have been shown to give efficient algorithms for the computation of two-dimensional …
Fast Discrete Fourier Transform algorithms requiring less than 0 (NlogN) multiplications
R Stasinski - arXiv preprint arXiv:2303.02647, 2023 - arxiv.org
In the paper it is shown that there exist infinite classes of fast DFT algorithms having
multiplicative complexity lower than O (NlogN), ie smaller than their arithmetical complexity …
multiplicative complexity lower than O (NlogN), ie smaller than their arithmetical complexity …
Reduced complexity optimal convolution based on the Discrete Hirschman Transform
D Xue, LS DeBrunner… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
The Discrete Hirschman Transform (DHT) is more computationally attractive than the
Discrete Fourier Transform (DFT). Based on its derived linear convolution, we have …
Discrete Fourier Transform (DFT). Based on its derived linear convolution, we have …
Fast convolution algorithms
HJ Nussbaumer, HJ Nussbaumer - Fast Fourier Transform and …, 1982 - Springer
The main objective of this chapter is to focus attention on fast algorithms for the summation
of lagged products. Such problems are very common in physics and are usually related to …
of lagged products. Such problems are very common in physics and are usually related to …
DFT computation by fast polynomial transform algorithms
HJ Nussbaumer - Electronics Letters, 1979 - infona.pl
A new method is introduced for the fast computation of multidimensional discrete Fourier
transforms (dft). We show that some multidimensional dfts are mapped efficiently into one …
transforms (dft). We show that some multidimensional dfts are mapped efficiently into one …
New polynomial transform algorithms for fast DFT computation
H Nussbaumer, P Quandalle - ICASSP'79. IEEE International …, 1979 - ieeexplore.ieee.org
Polynomial transforms defined in rings of polynomials, have been introduced recently and
shown to give efficient algorithms for the computation of two-dimensional convolutions. In …
shown to give efficient algorithms for the computation of two-dimensional convolutions. In …
Two-dimensional convolution and DFT computation
HJ Nussbaumer - Two-Dimensional Digital Signal Prcessing II …, 2006 - Springer
Many of the newest techniques for the fast computation of convolutions and DFTs such as
the Winograd Fouriei-~ transform algorithm [3.1], the Agarwal-Cooley fast convolution …
the Winograd Fouriei-~ transform algorithm [3.1], the Agarwal-Cooley fast convolution …
2-D FFT algorithm by matrix factorization in a 2-D space
M Wang, EB Lee - Multidimensional Systems and Signal Processing, 1994 - Springer
Abstract A new 2-D FFT algorithm is described. This algorithm applies a 2-D matrix
factorization technique in a 2-D space and offers a way to do 2-D FFT in both dimensions …
factorization technique in a 2-D space and offers a way to do 2-D FFT in both dimensions …