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
Online Botnet Detection Based on Incremental Discrete Fourier Transform
Botnet detection has attracted lots of attention since botnet attack is becoming one of the most serious threats on the Internet… 
1999
1999
Multiwavelet Construction via the Lifting Scheme
Lifting provides a simple method for constructing biorthogonal wavelet bases. We generalize lifting to the case of multiwavelets… 
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
Efficient one-dimensional systolic array realization of the discrete Fourier transform
A one-dimensional systolic array realizing the discrete Fourier transform (DFT) of nonstop input sequences is presented. Two… 
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
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… 
1983
1983
Two VLSI Structures for the Discrete Fourier Transform
Two VLSI structures for the computation of the discrete Fourier transform are presented. The first structure is a pipeline… 
1980
1980
A limited range discrete Fourier transform algorithm
Some recent work (1) has shown how one can compute limited portions of the discrete Fourier transform (DFT) of a long sequence by… 
1976
1976
The odd discrete Fourier transform
It is shown that the Discrete Fourier Transform (DFT), when used in the conventional manner with the frequency samples located at… 
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)