mathematics, the discrete-time Fourier transform (DTFT) is a form of Fourier analysis that is applicable to a sequence of discrete values. The DTFT is...
40 KB (5,076 words) - 15:50, 30 May 2025
In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of...
76 KB (12,338 words) - 04:38, 31 July 2025
large numbers. The discrete version of the Fourier transform (see below) can be evaluated quickly on computers using fast Fourier transform (FFT) algorithms...
38 KB (4,788 words) - 15:31, 27 April 2025
In mathematics, the discrete Fourier transform over a ring generalizes the discrete Fourier transform (DFT), of a function whose values are commonly complex...
20 KB (3,992 words) - 20:05, 19 June 2025
original Fourier transform on R or Rn, notably includes the discrete-time Fourier transform (DTFT, group = Z), the discrete Fourier transform (DFT, group...
177 KB (21,320 words) - 20:50, 1 August 2025
The short-time Fourier transform (STFT) is a Fourier-related transform used to determine the sinusoidal frequency and phase content of local sections of...
22 KB (4,046 words) - 13:46, 21 July 2025
non-uniform discrete Fourier transform (NUDFT or NDFT) of a signal is a type of Fourier transform, related to a discrete Fourier transform or discrete-time Fourier...
15 KB (2,481 words) - 15:53, 18 June 2025
analysis, a discrete wavelet transform (DWT) is any wavelet transform for which the wavelets are discretely sampled. As with other wavelet transforms, a key...
36 KB (5,217 words) - 22:32, 16 July 2025
continuous-time Fourier transform is evaluated on the s-domain's vertical axis (the imaginary axis), the discrete-time Fourier transform is evaluated...
43 KB (5,653 words) - 14:50, 27 July 2025
In mathematics the finite Fourier transform may refer to either another name for discrete-time Fourier transform (DTFT) of a finite-length series. E.g...
2 KB (298 words) - 14:04, 23 July 2023
Fourier-transform spectroscopy (FTS) is a measurement technique whereby spectra are collected based on measurements of the coherence of a radiative source...
15 KB (1,889 words) - 05:20, 25 May 2025
Frequency domain (redirect from Fourier domain)
maps a function having a discrete time domain into one having a discrete frequency domain. The discrete-time Fourier transform, on the other hand, maps...
10 KB (1,193 words) - 21:38, 1 June 2025
of transforms in mathematics. Abel transform Aboodh transform Bateman transform Fourier transform Fourier cosine transform Fourier sine transform Fractional...
3 KB (293 words) - 16:54, 5 July 2025
Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). A Fourier transform converts...
67 KB (7,809 words) - 14:47, 29 July 2025
fractional Fourier transform (FRFT) is a family of linear transformations generalizing the Fourier transform. It can be thought of as the Fourier transform to...
27 KB (3,937 words) - 02:28, 16 June 2025
the Fourier transform on finite groups is a generalization of the discrete Fourier transform from cyclic to arbitrary finite groups. The Fourier transform...
13 KB (2,052 words) - 20:50, 6 July 2025
the Fourier transform the counterpart is the discrete Fourier transform. In addition to spectral analysis of signals, discrete transforms play important...
2 KB (219 words) - 16:15, 19 October 2023
Hann function (section Fourier transform)
\end{aligned}}} The Discrete-time Fourier transform (DTFT) of the N + 1 {\displaystyle N+1} length, time-shifted sequence is defined by a Fourier series, which...
10 KB (1,674 words) - 02:56, 23 May 2025
a Fourier-related transform similar to the discrete Fourier transform (DFT), but using only real numbers. The DCTs are generally related to Fourier series...
101 KB (11,972 words) - 19:49, 30 July 2025
Circular convolution (section Discrete sequences)
example, in the context of the discrete-time Fourier transform (DTFT). In particular, the DTFT of the product of two discrete sequences is the periodic convolution...
11 KB (1,276 words) - 12:26, 17 December 2024
Harmonic analysis (redirect from Discrete harmonic analysis)
transform Continuous/periodic–discrete/aperiodic: Fourier series Discrete/aperiodic–continuous/periodic: Discrete-time Fourier transform Continuous/aperiodic–...
14 KB (1,634 words) - 18:04, 6 March 2025
Discrete Fourier transform Fast Fourier transform Fejér's theorem Fourier analysis Fourier inversion theorem Fourier sine and cosine series Fourier transform...
72 KB (11,152 words) - 20:53, 30 July 2025
Laplace transform, the Z transform is usually used in the context of one-sided signals, i.e. signals that are zero for t<0. The discrete-time Fourier transform...
37 KB (5,902 words) - 18:02, 1 June 2025
called Fourier series coefficients. The term Fourier series actually refers to the inverse Fourier transform, which is a sum of sinusoids at discrete frequencies...
7 KB (1,001 words) - 15:55, 27 May 2025
a discrete function, u [ n ] , {\displaystyle u[n],} with discrete-time Fourier transform (DTFT), U ( ω ) {\displaystyle U(\omega )} , and discrete Hilbert...
60 KB (8,169 words) - 19:09, 23 June 2025
Fourier transform infrared spectroscopy (FTIR) is a technique used to obtain an infrared spectrum of absorption or emission of a solid, liquid, or gas...
37 KB (4,802 words) - 00:54, 11 July 2025
}\right)=\sum _{n=0}^{\infty }a_{n}e^{-i\omega n}} is the discrete-time Fourier transform of the sequence a0, a1, .... In calculus, often the growth...
87 KB (14,462 words) - 22:42, 3 May 2025
mathematics, the Hartley transform (HT) is an integral transform closely related to the Fourier transform (FT), but which transforms real-valued functions...
10 KB (1,340 words) - 00:07, 18 June 2025
The modified discrete cosine transform (MDCT) is a transform based on the type-IV discrete cosine transform (DCT-IV), with the additional property of being...
23 KB (3,258 words) - 10:12, 7 March 2025
Multidimensional DSP with GPU acceleration (section Multidimensional discrete time fourier transform (M-D DTFT))
n_{2}-k_{2},...,n_{s}-k_{s})} In addition to convolution, the discrete-time Fourier transform (DTFT) is another technique which is often used in system analysis...
21 KB (2,902 words) - 23:31, 20 July 2024