Skip to search formSkip to main contentSkip to account menu

Discrete-time Fourier transform

Known as: IDTFT, DTFT, Discrete time fourier transform 
In mathematics, the discrete-time Fourier transform (DTFT) is a form of Fourier analysis that is applicable to the uniformly-spaced samples of a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
This paper investigates the performance of the zero-forcing (ZF) and minimum mean-square error (MMSE) equalizers in MIMO… 
2010
2010
In the paper a modified Park transformation from phase reference frame ABC to dq reference frame for wye connected stator winding… 
2009
2009
Clarke's classical model of mobile-radio reception assumes isotropic-rich scattering around the mobile receiver antenna. The… 
2009
2009
The discrete Fourier transform (DFT) maps a nite number of discrete time-domain samples to the same number of discrete Fourier… 
2009
2009
In this paper, a discrete-time algorithm for separately detecting the positive- and negative-sequence harmonic space-vector… 
2008
2008
It is well-known that the discrete Fourier transform (DFT) of a finite length discrete-time signal samples the discrete-time… 
2006
2006
Discrete multitone (DMT) systems have been widely adopted in broadband communications. When the transmission channel is frequency… 
2001
2001
The limitation of the dynamic range given by noise and spurious signals is discussed. Attention is paid to the proper unit (dBFS… 
1974
1974
The reader is undoubtedly familiar with the well known frequency domain methods such as the Nyquist and Bode diagrams, the…