The size of the buffered window to be analysed, in samples. It will add that much latency to the signal. This is not modulatable.
The size of the buffered window to be analysed, in samples. It will add that much latency to the signal.
ARGUMENT:: hopSize
ARGUMENT:: hopSize
How much the buffered window moves forward, in samples. This is not modulatable.
How much the buffered window moves forward, in samples. The -1 default value will default to half of winSize (overlap of 2).
ARGUMENT:: fftSize
ARGUMENT:: fftSize
How large will the FFT be, zero-padding the buffer to the right size, which should be bigger than the windowSize argument, bigger than 4 samples, and should be a power of 2. This is a way to oversample the FFT for extra precision. The -1 default value will default to windowSize. This is not modulatable.
How large will the FFT be, zero-padding the buffer to the right size, which should be bigger than the windowSize argument, bigger than 4 samples, and should be a power of 2. This is a way to oversample the FFT for extra precision. The -1 default value will default to windowSize.
ARGUMENT:: maxFFTSize
How large can the FFT be, by allocating memory at instantiation time. This is not modulatable.
RETURNS::
RETURNS::
Same as input, delayed by the winSize.
Same as input, delayed by the winSize.
@ -33,7 +37,7 @@ EXAMPLES::
Summing with the inverse (gain of -1) with a delay of the latency gives us CPU-expensive silence.
Summing with the inverse (gain of -1) with a delay of the latency gives us CPU-expensive silence.