代码搜索：如何学习 FFt？
找到约 10,000 项符合「如何学习 FFt？」的源代码
代码结果 10,000
www.eeworm.com/read/192226/8397220
m icftbyifft.m
function [BW,t2]=icftbyifft(wf,f,flag)
%本程序采用FFT计算连续时间Fourier变换。输出时间波形数据对(t,BW)。
if nargin==2;flag=1;end
L=length(f); %采样点数，应为2的幂次，以求快速。
F=f(length(f))-f(1); %窗口长度
df=F/L; %频率分辨率。
www.eeworm.com/read/191087/8433936
txt readme.txt
;*************************************************************************************
;*********************** SECTION 1: FFT LIBRARY ***********************************
;*************************
www.eeworm.com/read/291161/8439013
m dembisp.m
%D_BISP HOSA Demo: Estimating the Bispectrum (Direct & Indirect methods)
% and Bicoherence (auto and cross)
% demos of bispecd, bispeci, bicoher, bispecdx, bicoherx
%
echo of
www.eeworm.com/read/290613/8471795
m dembisp.m
%D_BISP HOSA Demo: Estimating the Bispectrum (Direct & Indirect methods)
% and Bicoherence (auto and cross)
% demos of bispecd, bispeci, bicoher, bispecdx, bicoherx
%
echo of
www.eeworm.com/read/390127/8482813
cpp overlap.cpp
//#include
#include"fft.h"
#include
#include
#include
#include
//#include "fft.cpp"
void main()
{
float h[8]={1,0,-2,1,0,0,0,0};
www.eeworm.com/read/389586/8512673
txt 53. c28x fast fourier transforms library (sprc081).txt
Fast Fourier Transforms are an efficient class of algorithms for the digital computation of the N-point Fourier transform (DFT). In general, their input sequence are assumed to be complex. In many rea
www.eeworm.com/read/389457/8518303
m circonv.m
function y=circonv(x1,x2,N)
if length(x1)>N
error('N must not be less than length of x1');
end
if length(x2)>N
error('N must not be less than length of x2');
end
X1k=fft(x1,N);
www.eeworm.com/read/289837/8523503
m dembisp.m
%D_BISP HOSA Demo: Estimating the Bispectrum (Direct & Indirect methods)
% and Bicoherence (auto and cross)
% demos of bispecd, bispeci, bicoher, bispecdx, bicoherx
%
echo of
www.eeworm.com/read/188318/8550838
m exa090300_2.m
%-----------------------------------------------------------------------------
% exa090300_2.m, for fig. 9.3.2,
%-----------------------------------------------------------------------------
clea
www.eeworm.com/read/289166/8570476
m circonv.m
function y=circonv(x1,x2,N)
if length(x1)>N
error('N must not be less than length of x1');
end
if length(x2)>N
error('N must not be less than length of x2');
end
X1k=fft(x1,N);