Linear predictive coding analysis on any arbitrary input signal. The spectrum of the input signal is modeled, and used to filter the source. This works most successfully if the source is spectrally flat to begin with, ie, an impulse train ( Impulse UGen ) or white noise ( WhiteNoise UGen ).
The two big hits to CPU costs here are large n, causing peaky calculation hits once per window as autocorrelation coefficients are calculated, and p as determining the order of the filter which is fitted, and thus the per sample output calculation cost.
(For more technicalities see John Makhoul (1975) "Linear Prediction: A Tutorial Review". Proceedings of the IEEE 63(4).)
input |
Original signal to analyse with the LPC model |
source |
Excitation to run through LPC derived filter |
n |
Windowsize for analysis in samples; limits of 1<=n<=1024 |
p |
Number of poles used to model spectrum of input within one window |
testE |
Whether to test for meeting of error condition, for variable number of poles solution up to p |
delta |
Test value, close to but just below 1. |
windowtype |
Windowing. 0 is rectangular window, abrupt swap of filter coefficients after every n samples. 1 is triangular window, and runs two LPCAnalyzers crossfading, for a smoother ride, at expense of double CPU cost. |