2 summary:: Inverse Fast Fourier Transform
3 related:: Classes/FFT, Guides/FFT-Overview
8 The inverse fast fourier transform converts from frequency content to a
11 The fast fourier transform analyzes the frequency content of a signal. The IFFT UGen converts this emphasis::frequency-domain:: information back into emphasis::time-domain:: audio data. Most often this is used as the end of a process which begins with link::Classes/FFT::, followed by frequency-domain processing using PV (phase-vocoder) UGens, followed by IFFT.
19 The FFT "chain" signal coming originally from an FFT UGen, perhaps via other PV UGens.
22 Defines how the data is windowed:
24 ## -1 || strong::rectangular:: windowing, simple but typically not recommended;
25 ## 0 || (the default) strong::Sine:: windowing, typically recommended for phase-vocoder work;
26 ## 1 || strong::Hann:: windowing, typically recommended for analysis work.
30 Can be used to account for zero-padding, in the same way as the link::Classes/FFT:: UGen.
33 The emphasis::time-domain:: audio signal.
36 The IFFT UGen converts the FFT data in-place (in the original FFT buffer) and overlap-adds the result to produce a continuous signal at its output.
43 b = Buffer.alloc(s,2048,1);
45 SynthDef("help-noopFFT", { arg out=0,bufnum=0;
47 in = WhiteNoise.ar(0.01);
48 chain = FFT(bufnum, in);
49 chain.inspect; // its an FFT
51 IFFT(chain) // inverse FFT
53 }).play(s,[\out,0,\bufnum,b.bufnum]);