Speech recognition Algorithm:
Speech recognition Algorithm: X(t) = Input speech signal. This input the speech signal is in time domain we convert it into frequency domain because in time domain sound can be easily differentiate from one another. Actually when we convert it into the frequency domain the speech attributes become visible in the frequency domain which is not visible in the time domain. when we convert it into a frequency domain, not all the frequency is help full. MFCC: start initially take STFT signal X(t) ===short time Fourier transform (STFT) Basically, we perform a Fourier transform. In common but it is a very lengthy process. X[n] = sum x(t) . e-jwn Fast Fourier transform is nothing but it is an algorithm for implementing Fourier transform. Basically, it is a method of implementing the algorithm .these are for implementaion.we use fast Fourier transform because it is an efficient algorithm Lets us say that we have...