No results for "Discrete transforms" (auto) in titles.

Suggestions for article titles:

1. Discrete transform: In signal processing, discrete transforms are mathematical transforms, often linear transforms, of signals between discrete domains, such as between discrete time and discrete frequency. Many common integral transforms used in signal processing have their discrete counterparts. (Mathematical transform on discrete signals) [100%] 2023-01-19 [Discrete transforms]
2. Fourier transform, discrete: A transform used for the harmonic analysis of functions given on a discrete set of points. If a function is given on the set of points $ t _ {k} = k \Delta t $ by its values $ x _ {k} $, $ k = 0 ... (Mathematics) [81%] 2023-10-25
3. Discrete wavelet transform: In numerical analysis and functional analysis, a discrete wavelet transform (DWT) is any wavelet transform for which the wavelets are discretely sampled. As with other wavelet transforms, a key advantage it has over Fourier transforms is temporal resolution: it captures ... (Transform in numerical harmonic analysis) [81%] 2023-07-19 [Numerical analysis] [Digital signal processing]...
4. Discrete Chebyshev transform: In applied mathematics, the discrete Chebyshev transform (DCT), named after Pafnuty Chebyshev, is either of two main varieties of DCTs: the discrete Chebyshev transform on the 'roots' grid of the Chebyshev polynomials of the first kind \displaystyle{ T_n (x) }[/math ... [81%] 2022-07-26 [Transforms]
5. Discrete cosine transform: A discrete cosine transform (DCT) expresses a finite sequence of data points in terms of a sum of cosine functions oscillating at different frequencies. The DCT, first proposed by Nasir Ahmed in 1972, is a widely used transformation technique in ... (Technique representing data as sums of cosine functions) [81%] 2021-12-23 [Digital signal processing] [Fourier analysis]...
6. 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 equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function ... (Type of Fourier transform in discrete mathematics) [81%] 2023-02-14 [Fourier analysis] [Digital signal processing]...
7. Discrete Hartley transform: A discrete Hartley transform (DHT) is a Fourier-related transform of discrete, periodic data similar to the discrete Fourier transform (DFT), with analogous applications in signal processing and related fields. Its main distinction from the DFT is that it transforms ... (Fourier-related mathematical transform) [81%] 2023-12-04 [Discrete transforms] [Fourier analysis]...
8. Discrete wavelet transform: In numerical analysis and functional analysis, a discrete wavelet transform (DWT) is any wavelet transform for which the wavelets are discretely sampled. As with other wavelet transforms, a key advantage it has over Fourier transforms is temporal resolution: it captures ... (Transform in numerical harmonic analysis) [81%] 2022-08-11 [Numerical analysis] [Digital signal processing]...
9. Discrete cosine transform: A discrete cosine transform (DCT) expresses a finite sequence of data points in terms of a sum of cosine functions oscillating at different frequencies. The DCT, first proposed by Nasir Ahmed in 1972, is a widely used transformation technique in ... (Technique used in signal processing and data compression) [81%] 2023-04-19 [Digital signal processing] [Fourier analysis]...
10. Discrete Fourier transform (general): In mathematics, the discrete Fourier transform over an arbitrary ring generalizes the discrete Fourier transform of a function whose values are complex numbers. Let \displaystyle{ R }[/math] be any ring, let \displaystyle{ n\geq 1 }[/math] be an integer, and ... (General) [81%] 2022-09-26 [Fourier analysis]
11. Discrete sine transform: In mathematics, the discrete sine transform (DST) is a Fourier-related transform similar to the discrete Fourier transform (DFT), but using a purely real matrix. It is equivalent to the imaginary parts of a DFT of roughly twice the length ... [81%] 2023-10-02 [Discrete transforms] [Fourier analysis]...
12. Discrete Hartley transform: A discrete Hartley transform (DHT) is a Fourier-related transform of discrete, periodic data similar to the discrete Fourier transform (DFT), with analogous applications in signal processing and related fields. Its main distinction from the DFT is that it transforms ... (Fourier-related mathematical transform) [81%] 2024-09-29 [Discrete transforms] [Fourier analysis]...
13. Discrete cosine transform: A discrete cosine transform (DCT) expresses a finite sequence of data points in terms of a sum of cosine functions oscillating at different frequencies. The DCT, first proposed by Nasir Ahmed in 1972, is a widely used transformation technique in ... (Technique used in signal processing and data compression) [81%] 2026-04-28 [Digital signal processing] [Fourier analysis]...
14. Modified discrete cosine transform: 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 lapped: it is designed to be performed on consecutive blocks of a larger dataset, where ... (Mathematical transform using in signal processing) [70%] 2023-02-28 [Fourier analysis] [Discrete transforms]...
15. Modified discrete cosine transform: 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 lapped: it is designed to be performed on consecutive blocks of a larger dataset, where ... (Mathematical transform using in signal processing) [70%] 2022-09-29 [Fourier analysis] [Discrete transforms]...
16. Discret: Cette page d’homonymie répertorie les différents sujets et articles portant le même nom. Dans le discours scientifique, un objet est dit discret lorsqu'il n'est pas continu. [67%] 2025-04-29
17. Transforma: Die Künstlergruppe Transforma wurde im Jahr 2001 von Luke Bennett, Baris Hasselbach und Simon Krahl in Berlin gegründet. Seitdem beschäftigt sie sich mit experimentellem Film, Audio-Video-Installationen, Live-Cinema- und Audio-Video-Performance. [63%] 2023-05-31
18. Irrational base discrete weighted transform: In mathematics, the irrational base discrete weighted transform (IBDWT) is a variant of the fast Fourier transform using an irrational base; it was developed by Richard Crandall (Reed College), Barry Fagin (Dartmouth College) and Joshua Doenias (NeXT Software) in the ... [63%] 2022-11-19 [FFT algorithms] [Discrete transforms]...
19. Non-uniform discrete Fourier transform: In applied mathematics, the nonuniform 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 transform, but in which the input signal is not sampled ... [63%] 2023-11-25 [Fourier analysis] [Transforms]...
20. Non-uniform discrete Fourier transform: In applied mathematics, 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 Fourier transform, but in which the input signal is not ... [63%] 2024-02-27 [Fourier analysis] [Transforms]...