Stages of the MFCC process

|Hi,everyone I am a freshman learning mathlab and now I am having trouble solving MFCC extraction stages. Here are the steps of the MFCC method that I know 1. Pre emphasize 2. Frame blocking 3. Windowing 4. Fast Fourier Transform 5. Mel tringular Filter 6. And MFCC with Discrete Cosine Transform (DCT). On the mel tringular filters function, I get a reference from Manolis Michailidis, but there are some who still eror, hope someone can help me. There may be some stages that you think are wrong. Please provide feedback. f_low=300; f_high=8000; filt_num=12; fs=16000;

%% computing band in mel-scale mel_low=2595*log10(1+(f_low/100)); mel_high=2595*log10(1+(f_high/100));

%% creating the mel-scaled vector Mel = linspace(mel_low,mel_high,filt_num);

%% computing frequencies of the Mel vector %Freq=700*((10.^(Mel/2595))-1); Freq=mel2hz(mel);

%% convert frequencies to nearest bins function H=formula(k,f,m) if k<f(m-1) H = 0; elseif (k>=f(m-1)&&k<=f(m)) H = (k-f(m-1))/(f(m)-f(m-1)); elseif (k>=f(m+1)&&k<=f(m)) H = (f(m+1)-k)/(f(m+1)-f(m)); elseif k>f(m+1) H = 0; end

    for m =2:length(Mel)+2
        for k=1:nfft+1
            if (k<f(Mel(m)-1));H(Mel,k)=0;
    elseif (k>=f(Mel(m)-1) && k<=(f(Mel(m))));H(Mel,k)=(k-f(Mel(m)-1))/(f(Mel(m))-f(Mel(m)-1));
    elseif (k>=f(Mel(m)) && k<=f(Mel(m)+1));H(Mel,k)=(f(Mel(m)+1)-k)/(f(Mel(m)+1)-f(Mel(m)));
        elseif (k>f(Mel(m)+1));H(Mel,k)=0;
            end
        end
end

Thank you so much. :)|