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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Botnet detection has attracted lots of attention since botnet attack is becoming one of the most serious threats on the Internet… 
2007
2007
Existing approaches to furnishing a basis of eigenvectors for the discrete Fourier transform (DFT) are based upon defining… 
1990
1990
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 one-dimensional systolic array realizing the discrete Fourier transform (DFT) of nonstop input sequences is presented. Two… 
Highly Cited
1989
Highly Cited
1989
1984
1984
In this paper the problem of computing the Discrete Fourier Transform (DFT) in VLSI is considered. We describe an approach to… 
1983
1983
Two VLSI structures for the computation of the discrete Fourier transform are presented. The first structure is a pipeline… 
1980
1980
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
It is shown that the Discrete Fourier Transform (DFT), when used in the conventional manner with the frequency samples located at… 
1973
1973
In a digital toll switching office a digital multifrequency (MF) receiver may be more economical than the present analog MF…