Wednesday, August 5, 2015

Signal Normalization

Normalization is basically bringing the two signals to the same range or a predefined range. It is to do with removing scale factor effect. Thus we may rescale to normalize amplitude dynamic range to swing between +1/-1 or power to be unity or phase to be zero. A typical example of a predefined range is the statistical perception of the normalization, which is transforming the signal so that its mean is 0 and standard deviation is 1. After such transform the canonical form is obtained. Transforming all signals to such canonical form eases and robustifies the process of comparisons as well as serving too different needs such as visualization, and analysis.


when comparing two different signals that mean two different things (but equally important or with an equal significance regarding the information the signals carry), would you expect to be comparing two signals, one with values in the ballpark of ±1 and the other with no samples with magnitude at least 28 or so?


Normalization means that you're not comparing an elephant to a bug at least not with regard to mass. unless you make the bug look as big as the elephant, and then you start comparing what makes the bug different than the elephant.

Fast Fourier Transform(FFT)

Spectral analysis shows that different timbres in speech signals corresponds to different energy distribution over frequencies. Therefore we usually perform FFT to obtain the magnitude frequency response of each frame. When we perform FFT on a frame, we assume that the signal within a frame is periodic, and continuous when wrapping around. If this is not the case, we can still perform FFT but the in continuity at the frame's first and last points is likely to introduce undesirable effects in the frequency response. To deal with this problem, we have two strategies: Multiply each frame by a Hamming window to increase its continuity at the first and last points. Take a frame of a variable size such that it always contains a integer multiple number of the fundamental periods of the speech signal. The second strategy encounters difficulty in practice since the identification of the fundamental period is not a trivial problem. Moreover, unvoiced sounds do not have a fundamental period at all. Consequently, we usually adopt the first strategy to multiply the frame by a Hamming window before performing FFT.