Analysis of Compressed Speech Signals in an Automatic Speaker Recognition System

This paper analyzes the effects popular audio compression algorithms have on the performance of a speaker recognition system. Popular audio compression algorithms were used to compress both clean and noisy speech before being passed to a speaker recognition system. The features extracted from each speaker were 19-dimensional Mel-Frequency Cepstrum Coefficients (MFCC) and the corresponding features were modeled using a 16 mixture Gaussian Mixture Model (GMM). Our experiments show that compression will have a negative effect on recognition rates if the compressed speech is clean. However, if small amounts of white Gaussian noise are added before the speech is compressed, recognition rates can be increased by as much as 7% with certain compression algorithms.