Skip to search formSkip to main contentSkip to account menu

Discrete Fourier transform

Known as: Inverse discrete Fourier transform, Offset DFT, Centered DFT 
In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into an equivalent-length… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
Alan V. OppenheimAli AkansuAnalog multiplierAudio forensics

Broader (1)

Numerical analysis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Generalized Discrete Fourier Transform With Nonlinear Phase
Constant modulus transforms like discrete Fourier transform (DFT), Walsh transform, and Gold codes have been successfully used… 
Highly Cited
2007
Highly Cited
2007
A new approach to detect broken rotor bars in induction machines by current spectrum analysis
1991
1991
A new systolic array algorithm for discrete Fourier transform
  • Chi-Min LiuC. Jen
  • ., IEEE International Sympoisum on Circuits and…
  • 1991
  • Corpus ID: 61650224
A new systolic algorithm for computing the discrete Fourier transform (DFT) is presented. The algorithm exhibits the minimum… 
1990
1990
An RNS discrete Fourier transform implementation
A novel discrete Fourier transform (DFT) implementation is described. It is based on the union of number theoretic transforms… 
Highly Cited
1989
Highly Cited
1989
A neural net approach to discrete Hartley and Fourier transforms
The authors present an electronic circuit, based on a neural (i.e. multiply connected) net to compute the discrete Fourier… 
1987
1987
Vectorized mixed radix discrete Fourier transform algorithms
A number of previous attempts at the vectorization of the fast Fourier transform (FFT) algorithm have fallen somewhat short of… 
Highly Cited
1987
Highly Cited
1987
New forms of shape invariants from elliptic fourier descriptors
Highly Cited
1985
Highly Cited
1985
On computing the discrete Fourier and cosine transforms
An efficient algorithm based on real matrix decomposition is developed for computing a class of sinusoidal transforms, that… 
Review
1982
Review
1982
Continuous and discrete Fourier transforms of steplike waveforms
A steplike waveform which has attained its final value is converted into a duration-limited one which preserves the spectrum of… 
1973
1973
Digital MF Receiver Using Discrete Fourier Transform
In a digital toll switching office a digital multifrequency (MF) receiver may be more economical than the present analog MF… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)