Results 241 to 250 of about 1,798,139 (280)
Some of the next articles are maybe not open access.
Discrete-Time Fourier Transform Discrete Fourier Transform
2022Muhammad N. Khan +2 more
openaire +1 more source
Uniqueness of the discrete Fourier transform
Signal Processing, 2023Isabelle Baraquin, Nicolas Ratier
openaire +2 more sources
The Discrete Fourier Transform
2018The DTFT of a discrete-time signal is a continuous function of the frequency (\( \omega \)), and hence, the relation between \( X\left( {\text{e}^{{j}\omega } } \right) \) and \( x(n) \) is not a computationally convenient representation. However, it is possible to develop an alternative frequency representation called the discrete Fourier transform ...
K. Deergha Rao, M. N. S. Swamy
openaire +1 more source
The Discrete Fourier Transform
1993Abstract We will consider how several different networks handle many common algorithms. In order to do this, we follow Preparata and Vuillemin in [125] in defining a pair of generic parallel algorithms that can be easily implemented on the common network-Naturally, some networks are better than others for developing parallel ...
openaire +1 more source
The discrete Fourier transform
1992In Chapter 2 we developed properties of the (continuous-time) direct Fourier transform and the inverse Fourier transform, the two constituting an integral pair. Whereas Fourier series analysis is largely concerned with functions which are treated as being periodic, the Fourier transform provides an instrument for the analysis of non-periodic functions.
openaire +1 more source
2002
The Fourier Transform has wide applications in scientific computing and engineering. Although it has a continuous version, we will consider only the discrete version (DFT) and present what is commonly known as the Fast Fourier Transform (FFT) algorithm.
openaire +1 more source
The Fourier Transform has wide applications in scientific computing and engineering. Although it has a continuous version, we will consider only the discrete version (DFT) and present what is commonly known as the Fast Fourier Transform (FFT) algorithm.
openaire +1 more source
Discrete Fourier transforms when the number of data samples is prime
Proceedings of the IEEE, 1968C M Rader
exaly
The discrete fractional Fourier transform
IEEE Transactions on Signal Processing, 2000Cagatay Candan, H M Ozaktas, M A Kutay
exaly