代码搜索：FFt 有哪些应用？
找到约 10,000 项符合「FFt 有哪些应用？」的源代码
代码结果 10,000
www.eeworm.com/read/206291/15297009
txt note.txt
bitrev.c - bit reversed index
complex.c - complex arithmetic in C
cmplx.h - header file for complex.c
dft.c - DFT
dftmerge.c - DFT merging
dtft.c - DTFT at single frequency
dtftr.c - DTFT
www.eeworm.com/read/170938/5402550
m wienerdec.m
function [H,out] = Wienerdec(g,in,sig,sigma)
% wienerdec -- Wiener filter for deconvolution.
% Usage
% [H,out] = wienerdec(g,in,sigma)
% Inputs
% g Convolution filter.
% in Degraded sign
www.eeworm.com/read/168081/5449611
txt correl.txt
Procedure CORREL(DATA1,DATA2:array of real;N:integer;var ANS:array of real);
var
FFT:array[0..128] of real;
NO2,I:integer; DUM,DUM1,DUM2:real;
begin
TWOFFT(DATA1, DATA2, FFT, ANS, N)
www.eeworm.com/read/167220/5461918
m harw.m
function y=harw(x,N)
Fs=fft(x,N);
for j=-1:(log(N/2)/log(2))
if(j==-1)a(1)=ifft(Fs(1:1),1)
else
a((2^j)+1:(2^(j+1)))=ifft(Fs((2^j)+1:(2^(j+1))),(2^(j+1))-(2^j));
end
end
%
www.eeworm.com/read/157882/5601989
asm c2cx0064.asm
.file "c2cx0064.asm"
.title "0064 point DIT Radix-2, Complex FFT"
.width 120
N .set 64 ; NUMBER OF POINTS FOR FFT
***************************
www.eeworm.com/read/157882/5601999
asm c2cx0016.asm
.file "c2cx0016.asm"
.title "0016 point DIT Radix-2, Complex FFT"
.width 120
N .set 16 ; NUMBER OF POINTS FOR FFT
***************************
www.eeworm.com/read/157882/5602004
asm c2cx0032.asm
.file "c2cx0032.asm"
.title "0032 point DIT Radix-2, Complex FFT"
.width 120
N .set 32 ; NUMBER OF POINTS FOR FFT
***************************
www.eeworm.com/read/157882/5602005
asm c2cx0128.asm
.file "c2cx0128.asm"
.title "0128 point DIT Radix-2, Complex FFT"
.width 120
N .set 128 ; NUMBER OF POINTS FOR FFT
***************************
www.eeworm.com/read/475765/6778131
m p11_9.m
% P11_9.M Compare the magnitude of FFT of two sine waves ( 20 Hertz vs. 19 Hertz)
% N number of samples
% If N samples of the |FFT| are plotted, there will be a symmetry
% about the frequ
www.eeworm.com/read/427917/6843418
asv qiuzhi.asv
function [A,P,A1,P1,A0,P0,y]=qiuzhi(S,N,num,den)
y=filter(num,den,S);
%y=awgn(y,20);
y=y+normrnd(0,0.06,1,N+1);
ham=hamming(N+1);%加窗函数
%S=S.*ham';
%y=y.*ham';
Y = fft(S,N); %做FFT
Y0=fft(y,N);