Search results

Jump to: navigation, search
  • ...tw.org/ FFTW] Is a C subroutine library for computing the Discrete Fourier transform (DFT) in one or more dimensions on real and complex inputs.
    14 KB (1,910 words) - 17:42, 8 April 2024
  • * DCT → [[Discrete Cosine Transform]] * [[Discrete Cosine Transform]]
    5 KB (467 words) - 20:49, 24 July 2019
  • * Modified Discrete Cosine Transform ([[MDCT]]) is used for noise analysis * Fast Fourier Transform ([[FFT]]) is used for tonal analysis
    12 KB (1,706 words) - 13:38, 15 March 2022
  • ...ncies by processing the filter bank output with a Modified Discrete Cosine Transform ([[MDCT]]). The polyphase [[filterbank]] and the MDCT are together called a ...a time resolution of about x ms. There is a 50% overlap between successive transform windows, so the window size is 36 for long blocks.
    32 KB (4,966 words) - 09:42, 25 March 2024
  • ...the [[time domain]] into the [[frequency domain]]. And just as the fourier transform uses sine and cosine waves to represent a signal, the DCT only uses cosine The DCT is an invertible, discrete orthogonal transformation. An orthogonal transformation consists of multip
    623 B (93 words) - 17:29, 13 June 2007
  • ...easing of the [[bitrate]] to encode a series of [[Modified Discrete Cosine Transform|MDCT]] coefficients of a particular [[transient]] is one way to combat [[Pr ... to examine fourier series behaviour (note that [[Modified Discrete Cosine Transform|MDCT]] behaviour is not totally identical):
    3 KB (423 words) - 16:46, 14 June 2007
  • ...T''') is an efficient algorithm for calculating the [[DFT|discrete Fourier transform]] (DFT). The FFT produces the same results as a DFT but it reduces the exec * {{wikipedia|Fast Fourier transform}}
    766 B (115 words) - 12:45, 18 August 2023
  • The '''Modified Discrete Cosine Transform''' ('''MDCT''') is a [[DCT]]-IV transform. The MDCT tries to minimize blocking artifacts. It is common in lossy audio As a lapped transform, the MDCT is a bit unusual compared to other Fourier-related transforms in that it has half as many outputs as inputs (instead o
    2 KB (306 words) - 13:07, 5 October 2016
  • ...ity and phase, usually from 0Hz to Nyquist frequency. The discrete Fourier transform is for sampled data (i.e. digital audio). N is the window or block size. If ...ves you the best of both worlds. It does require more processing to do the transform - if your overlap is 50%, you are computing FFTs for twice as many samples.
    2 KB (324 words) - 11:48, 4 April 2022

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