代码搜索:如何学习 FFt?

找到约 10,000 项符合「如何学习 FFt?」的源代码

代码结果 10,000
www.eeworm.com/read/216443/15007047

m dft.m

function f=dft(f,N,dim); %DFT Normalized Discrete Fourier Transform % Usage: f=dft(f); % f=dft(f,N,dim); % % This function computes a normalized discrete Fourier transform. This % is
www.eeworm.com/read/215197/15070774

m melbankm.m

function [x,mn,mx]=melbankm(p,n,fs,fl,fh,w) %MELBANKM determine matrix for a mel-spaced filterbank [X,MN,MX]=(P,N,FS,FL,FH,W) % % Inputs: p number of filters in filterbank % n length of fft
www.eeworm.com/read/214970/15081460

m melbankm.m

function [x,mn,mx]=melbankm(p,n,fs,fl,fh,w) %MELBANKM determine matrix for a mel-spaced filterbank [X,MN,MX]=(P,N,FS,FL,FH,W) % % Inputs: p number of filters in filterbank % n length of fft
www.eeworm.com/read/214339/15105213

log cc_build_debug.log

------------------------------ fft.pjt - Debug ------------------------------ Build Complete, 0 Errors, 0 Warnings, 0 Remarks.
www.eeworm.com/read/208657/15239806

m ffte.m

function fre=ffte(y,u,n) % fre=ffte(y,u,n) very rough fft based transfer function estimate % Each column of y,(u) contains the story of the related output,(input). % n is the number of points in
www.eeworm.com/read/167220/5461912

m iharw.m

function y=iharw(x,N) for j=-1:(log(N/2)/log(2)) if(j==-1) a(1)=fft(x(1:1),1); else a((2^j)+1:(2^(j+1)))=fft(x((2^j)+1:(2^(j+1))),(2^(j+1))-(2^j)); end end %a(N/2+
www.eeworm.com/read/475502/6790058

m dffthlp.m

function dffthlp % DFFTHLP Help file for DFFTGUI % ADSP Toolbox: Version 2.0 % For use with "Analog and Digital Signal Processing", 2nd Ed. % Published by PWS Publishing Co. % % Ashok Ambar
www.eeworm.com/read/472861/6859004

m ffte.m

function fre=ffte(y,u,n) % fre=ffte(y,u,n) very rough fft based transfer function estimate % Each column of y,(u) contains the story of the related output,(input). % n is the number of points in
www.eeworm.com/read/471097/6896958

m melbankm.m

function [x,mn,mx]=melbankm(p,n,fs,fl,fh,w) %MELBANKM determine matrix for a mel-spaced filterbank [X,MN,MX]=(P,N,FS,FL,FH,W) % % Inputs: p number of filters in filterbank % n length of fft
www.eeworm.com/read/393582/8274289

log cc_build_custom.log

------------------------------ FFT.pjt - Custom ------------------------------ Build Complete, 0 Errors, 0 Warnings, 0 Remarks.