Search results

• Fourier transform (section Fourier transform for periodic functions)
  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 (19,698 words) - 19:43, 6 February 2024
• Discrete cosine transform
  differential equations. A DCT is a Fourier-related transform similar to the discrete Fourier transform (DFT), but using only real numbers. The DCTs are generally
  104 KB (11,066 words) - 19:34, 8 February 2024
• Fast Fourier transform
  N) discrete Fourier transform algorithm A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence
  63 KB (6,713 words) - 19:23, 6 February 2024
• Frequency domain (redirect from Transform domain)
  systems. Fourier transform – aperiodic signals, transients. Laplace transform – electronic circuits and control systems. Z transform – discrete-time signals
  11 KB (1,231 words) - 21:16, 8 February 2024
• Wavelet transform (section Comparison with Fourier transform and time-frequency analysis)
  Chirplet transform Complex wavelet transform Constant-Q transform Continuous wavelet transform Daubechies wavelet Discrete wavelet transform DjVu format
  28 KB (3,612 words) - 19:31, 6 February 2024
• Transform coding
  of transform coding that uses sampling in one or more domains as its transform. Karhunen–Loève theorem Transformation (function) Wavelet transform Muchahary
  7 KB (822 words) - 14:50, 6 February 2024
• Discrete wavelet transform (section The dual-tree complex wavelet transform (DCWT))
  Short description: Transform in numerical harmonic analysis In numerical analysis and functional analysis, a discrete wavelet transform (DWT) is any wavelet
  32 KB (4,374 words) - 16:14, 6 February 2024
• Modified discrete cosine transform (section Inverse transform)
  Mathematical transform using in signal processing The modified discrete cosine transform (MDCT) is a transform based on the type-IV discrete cosine transform (DCT-IV)
  23 KB (3,204 words) - 23:14, 6 February 2024
• Laplace transform (section Bilateral Laplace transform)
  Laplace–Stieltjes transform of g and the Laplace transform of f coincide. In general, the Laplace–Stieltjes transform is the Laplace transform of the Stieltjes
  68 KB (7,288 words) - 16:35, 6 February 2024
• Discrete Fourier transform (section Uniqueness of the Discrete Fourier Transform)
  Discrete Fourier Transform Discrete Fourier Transform Indexing and shifting of Discrete Fourier Transform Discrete Fourier Transform Properties Generalized
  68 KB (9,274 words) - 14:41, 6 February 2024
• Adaptive Transform Acoustic Coding
  subbands are then MDCT encoded using a fixed-length transform. Unlike nearly all modern formats, the transform length cannot be varied to optimize coding transients
  15 KB (1,834 words) - 23:15, 6 March 2023
• Integral transform
  back to the original function space using the inverse transform. An integral transform is any transform [math]\displaystyle{ T }[/math] of the following form:
  13 KB (1,271 words) - 15:32, 6 February 2024
• Extract, transform, load (section Transform)
  non-technical users as Citizen Integrators. Main page: Extract, load, transform Extract, load, transform (ELT) is a variant of ETL where the extracted data is loaded
  27 KB (3,882 words) - 23:51, 6 February 2024
• Quantum Fourier transform (section Relation to quantum Hadamard transform)
  quantum Fourier transform (QFT) is a linear transformation on quantum bits, and is the quantum analogue of the discrete Fourier transform. The quantum Fourier
  16 KB (2,245 words) - 15:53, 6 February 2024
• Burrows–Wheeler transform (section Dynamic Burrows–Wheeler transform)
  used, else we cannot invert the transform, since all circular permutations of a string has the same Burrows–Wheeler transform. The following pseudocode gives
  38 KB (3,374 words) - 18:07, 8 February 2024
• Discrete sine transform
  mathematics, the discrete sine transform (DST) is a Fourier-related transform similar to the discrete Fourier transform (DFT), but using a purely real
  14 KB (1,987 words) - 23:18, 6 February 2024
• Lapped transform
  non-overlapping block transform had been used. Lapped transforms substantially reduce the blocking artifacts that otherwise occur with block transform coding techniques
  3 KB (317 words) - 23:07, 6 February 2024
• Move-to-front transform (section The transform)
  messages, the MTF transform may actually increase the entropy. An important use of the MTF transform is in Burrows–Wheeler transform based compression
  11 KB (1,558 words) - 19:29, 6 February 2024
• Z-transform (section Bilateral Z-transform)
  discrete Fourier transform (DFT). (See Discrete-time Fourier transform § Periodic data.) Main page: Bilinear transform The bilinear transform can be used to
  36 KB (4,006 words) - 19:37, 6 February 2024
• Fourier-transform infrared spectroscopy (section Fourier transform)
  Discrete Fourier transform – Type of Fourier transform in discrete mathematics − for computing periodicity in evenly spaced data Fourier transform – Mathematical
  37 KB (4,738 words) - 23:14, 6 February 2024

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)