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.
2015
2015
The Fourier transform is an integral of the product of a signal (waveform) to be analyzed and a complex exponential function with… 
2010
2010
To explore the principle and performances of Q uantization Index Modulation (QIM) watermarking algorithm , the realization… 
2005
2005
In many applications, local or remote sensors send in streams of data, and the system needs to monitor the streams to discover… 
1990
1990
A novel discrete Fourier transform (DFT) implementation is described. It is based on the union of number theoretic transforms… 
1990
1990
The authors generalize the weighted redundancy transform (WRT) algorithm for computing the multidimensional discrete Fourier… 
Highly Cited
1989
Highly Cited
1989
A one-dimensional systolic array realizing the discrete Fourier transform (DFT) of nonstop input sequences is presented. Two… 
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
An architecture for a fast DFT processor is presented, which is well suited for implementation using custom or semicustom LSI… 
1981
1981
A mathematical approach towards the development of computational arrays for the Discrete Fourier Transform (DFT) is pursued in… 
1973
1973
In a digital toll switching office a digital multifrequency (MF) receiver may be more economical than the present analog MF…