代码搜索：FFt 有哪些应用？
找到约 10,000 项符合「FFt 有哪些应用？」的源代码
代码结果 10,000
www.eeworm.com/read/300325/13919440
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/300325/13919443
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/135438/13932661
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/134016/14012255
m convfft.m
function [out] = convfft(z1,z2)
%CONVFFT FFT-based convolution and polynomial multiplication.
% C = CONVFFT(A, B) convolves vectors A and B. The resulting
% vector is length LENGTH(A)+LENGTH
www.eeworm.com/read/204920/15331320
c main.c
extern void fft(int);
#define N 1024
void main()
{
test();
while(1);
}
www.eeworm.com/read/204920/15331329
c main.c
extern void fft(int);
#define N 1024
void main()
{
test();
while(1);
}
www.eeworm.com/read/202967/15368676
m exa090300_2.m
%-----------------------------------------------------------------------------
% exa090300_2.m, for fig. 9.3.2,
%-----------------------------------------------------------------------------
clea
www.eeworm.com/read/202224/15389132
m mm2201.m
% mm2201.m
N = 128; % choose a power of 2 for speed
t = linspace(0,3,N); % time points for function evaluation
f = 2*exp(-3*t); % evaluate the function and minimize aliasing: f(3) ~ 0
Ts = t(2)
www.eeworm.com/read/200650/15428112
m ex.m
x1=wavread('late_cafe');
x2=x1(1:65536);
s1=auread('late_cafe_out');
s2=s1(1:65536);
%fs=128;
%t=(1:128)/128;
%c1=sin(2*pi*t*8);
%c2=sin(2*pi*t*10);
%c3=sin(2*pi*t*60);
%c4=c1+c2+c3;
%plot(c
www.eeworm.com/read/107176/15612151
m ex4-14.m
% ex4-14.m
% exercise 4.14 encryption
A = [0 0 1 0 0; 0 0 1 0 1; 1 0 0 1 1; 1 0 1 0 0 ;1 0 0 1 0; 0 1 1 1 1;
1 1 0 0 1; 1 1 1 1 1; 0 1 1 0 1; 0 1 0 0 1; 0 0 0 1 1; 1 0 0 1 0;
0 1 1 1 1; 1 0 0 1 1