Short-Term Autocorrelation and Covariance Recall our definition of the autocorrelation function: Note: · this can be regarded as a dot product of and . · let's not forget preemphasis, windowing, and centering the window w.r.t. the frame, and that scaling is optional. What would C++ code look like: We note that we can save some multiplications by reusing products: This is known as the factored autocorrelation computation. It saves about 25% CPU, replacing multiplications with additions and more complicated indexing. Similarly, recall our definition of the covariance function: Note: · we use N-p points · symmetric so that only the terms need to be computed This can be simplified using the recursion: Autocorrelation functions for the word "three" comparing the consonant portion of the waveform to the vowel (256-point Hamming window). Note: · shape for the low order lags - what does this correspond to? · regularity of peaks for the vowel - why? · exponentially-decaying shape - which harmonic? · what does a negative correlation value mean? array-style: for(k=0; k