• the 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...
    14 KB (2,447 words) - 14:28, 15 March 2025
  • 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) - 03:43, 27 February 2025
  • Thumbnail for Discrete Fourier transform
    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,333 words) - 05:19, 3 May 2025
  • Thumbnail for Fourier analysis
    Fourier-related transforms Laplace transform (LT) Two-sided Laplace transform Mellin transform Non-uniform discrete Fourier transform (NDFT) Quantum Fourier transform...
    38 KB (4,788 words) - 15:31, 27 April 2025
  • Thumbnail for Fast Fourier transform
    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,814 words) - 18:05, 2 May 2025
  • Thumbnail for Fourier transform
    In mathematics, the Fourier transform (FT) is an integral transform that takes a function as input then outputs another function that describes the extent...
    177 KB (21,314 words) - 18:03, 29 April 2025
  • transforms Parseval's theorem Paley–Wiener theorem Projection-slice theorem Frequency spectrum Discrete Fourier series Non-uniform discrete Fourier transform...
    3 KB (224 words) - 19:08, 14 September 2024
  • Thumbnail for Fourier series
    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,149 words) - 05:20, 3 May 2025
  • Thumbnail for Hadamard transform
    Hadamard transform (also known as the Walsh–Hadamard transform, Hadamard–Rademacher–Walsh transform, Walsh transform, or Walsh–Fourier transform) is an...
    32 KB (4,739 words) - 07:43, 1 April 2025
  • Thumbnail for Frequency domain
    domain. A discrete frequency domain is a frequency domain that is discrete rather than continuous. For example, the discrete Fourier transform maps a function...
    10 KB (1,195 words) - 03:16, 1 February 2025
  • representation to a frequency domain representation. The discrete-domain multidimensional Fourier transform (FT) can be computed as follows: F ( w 1 , w 2 , …...
    24 KB (4,602 words) - 04:59, 25 March 2025
  • Thumbnail for Pontryagin duality
    Pontryagin duality (category Fourier analysis)
    is a (non-canonically) isomorphic group. Moreover, any function on a finite abelian group can be recovered from its discrete Fourier transform. The theory...
    39 KB (5,827 words) - 15:35, 23 April 2025
  • incomplete time series. Least-squares spectral analysis Non-uniform discrete Fourier transform Spacetime Myron Scholes; Joseph Williams (1977). "Estimating...
    7 KB (638 words) - 23:59, 5 April 2025
  • Thumbnail for Wavelet
    divisions of the FFT which uses the same basis functions as the discrete Fourier transform (DFT). This complexity only applies when the filter size has no...
    54 KB (7,213 words) - 02:17, 25 February 2025
  • Thumbnail for Window function
    Window function (category Fourier analysis)
    that there is no leakage at a discrete set of harmonically-related frequencies sampled by the discrete Fourier transform (DFT). (The spectral nulls are...
    73 KB (8,662 words) - 03:53, 27 April 2025
  • Thumbnail for Continuous uniform distribution
    probability calculus in relation to dice. Discrete uniform distribution Beta distribution Box–Muller transform Probability plot Q–Q plot Rectangular function...
    28 KB (4,230 words) - 23:30, 5 April 2025
  • produces a temporal or spatial domain representation, whereas a discrete Fourier transform produces the frequency domain representation. Time domain refers...
    27 KB (2,991 words) - 18:08, 5 January 2025
  • approximation of the Least-squares spectral analysis Non-uniform discrete Fourier transform Non-parametric methods for which the signal samples must be...
    23 KB (3,535 words) - 16:38, 18 March 2025
  • Thumbnail for Heaviside step function
    The Fourier transform of the Heaviside step function is a distribution. Using one choice of constants for the definition of the Fourier transform we have...
    14 KB (2,157 words) - 22:18, 25 April 2025
  • Thumbnail for Nyquist–Shannon sampling theorem
    Nyquist–Shannon sampling theorem (category Theorems in Fourier analysis)
    transition from continuous time to discrete time (see Discrete-time Fourier transform#Relation to Fourier Transform), and it is needed to preserve the...
    51 KB (6,721 words) - 06:42, 3 April 2025
  • Thumbnail for Probability distribution
    distribution that is discrete, and which provides information about the population distribution. Additionally, the discrete uniform distribution is commonly...
    48 KB (6,688 words) - 17:43, 6 May 2025
  • Thumbnail for Dirac delta function
    Dirac delta function (category Fourier analysis)
    imposing self-adjointness of the Fourier transform. By analytic continuation of the Fourier transform, the Laplace transform of the delta function is found...
    96 KB (14,231 words) - 04:12, 23 April 2025
  • Thumbnail for Uncertainty principle
    X_{1},\ldots ,X_{N-1},} be its discrete Fourier transform. Denote by ‖ x ‖ 0 {\displaystyle \|x\|_{0}} the number of non-zero elements in the time sequence...
    139 KB (19,263 words) - 21:15, 14 April 2025
  • Thumbnail for Hilbert space
    aspects of the Fourier transform of a function. Whereas Fourier analysis decomposes a function defined on a compact set into the discrete spectrum of the...
    128 KB (17,489 words) - 05:39, 2 May 2025
  • Thumbnail for Least-squares spectral analysis
    non-existent data just so to be able to run a Fourier-based algorithm. Non-uniform discrete Fourier transform Orthogonal functions SigSpec Sinusoidal model...
    28 KB (3,354 words) - 11:45, 30 May 2024
  • Spectral leakage (category Fourier analysis)
    The Fourier transform of a function of time, s(t), is a complex-valued function of frequency, S(f), often referred to as a frequency spectrum. Any linear...
    25 KB (2,926 words) - 05:08, 11 January 2025
  • Poisson summation formula (category Fourier analysis)
    defined by discrete samples of the original function's Fourier transform. And conversely, the periodic summation of a function's Fourier transform is completely...
    30 KB (4,951 words) - 03:09, 20 April 2025
  • {\displaystyle c=1} are kept fixed by the Fourier transform (they are eigenfunctions of the Fourier transform with eigenvalue 1). A physical realization...
    30 KB (5,023 words) - 17:40, 4 April 2025
  • Stack. This method can be implemeted by fast fractional fourier transform (FrFT). The discrete photography operator P α [ ⋅ ] {\displaystyle {\mathcal...
    38 KB (4,662 words) - 00:13, 23 April 2025
  • Thumbnail for Linear time-invariant system
    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...
    36 KB (5,855 words) - 23:05, 1 September 2024