代码搜索：FFt 有哪些应用？
找到约 10,000 项符合「FFt 有哪些应用？」的源代码
代码结果 10,000
www.eeworm.com/read/280774/10292538
h kiss_fftr.h
#ifndef KISS_FTR_H
#define KISS_FTR_H
#include "kiss_fft.h"
#ifdef __cplusplus
extern "C" {
#endif
/*
Real optimized version can save about 45% cpu time vs. complex fft of a real seq.
www.eeworm.com/read/278048/10578336
asv rx.asv
% rx
disp('Receiving')
rx_chunk
% perform fft to recover original data from time domain sets
recv_spaced_chunks = zeros(num_chunks,fft_size);
for i = 1:num_chunks
recv_spaced_chunks(i,1:fft_s
www.eeworm.com/read/278048/10578447
m rx.m
% rx
disp('Receiving')
rx_chunk
% perform fft to recover original data from time domain sets
recv_spaced_chunks = zeros(num_chunks,fft_size);
for i = 1:num_chunks
recv_spaced_chunks(i,1:fft_s
www.eeworm.com/read/466466/7035623
h kiss_fftr.h
#ifndef KISS_FTR_H
#define KISS_FTR_H
#include "kiss_fft.h"
#ifdef __cplusplus
extern "C" {
#endif
/*
Real optimized version can save about 45% cpu time vs. complex fft of a real seq.
www.eeworm.com/read/337898/7416284
asv maiyadb.asv
% 分析LFM信号在不同多普勒频率时的脉压性能
% 不考虑噪声因素
% 结论：线性调频信号的主旁瓣比会因多普勒频移的增加而降低，但所受到的影响并不明显，
% 即当存在较大的多普勒频率时，同样能获得大的压缩比，也就是说线性调频信号对多普勒频率不敏感。
clear all;
close all;
clc;
% 参数设置
tao=20e-6; % 脉宽,s
bw=2e6; ...
www.eeworm.com/read/337898/7416285
m maiyadb.m
% 分析LFM信号在不同多普勒频率时的脉压性能
% 不考虑噪声因素
% 结论：线性调频信号的主旁瓣比会因多普勒频移的增加而降低，但所受到的影响并不明显，
% 即当存在较大的多普勒频率时，同样能获得大的压缩比，也就是说线性调频信号对多普勒频率不敏感。
clear all;
close all;
clc;
% 参数设置
tao=20e-6; % 脉宽,s
bw=2e6; ...
www.eeworm.com/read/448922/7522161
asv rx.asv
% rx
disp('Receiving')
rx_chunk
% perform fft to recover original data from time domain sets
recv_spaced_chunks = zeros(num_chunks,fft_size);
for i = 1:num_chunks
recv_spaced_chunks(i,1:fft_s
www.eeworm.com/read/448922/7522202
m rx.m
% rx
disp('Receiving')
rx_chunk
% perform fft to recover original data from time domain sets
recv_spaced_chunks = zeros(num_chunks,fft_size);
for i = 1:num_chunks
recv_spaced_chunks(i,1:fft_s
www.eeworm.com/read/443803/7623115
h kiss_fftr.h
#ifndef KISS_FTR_H
#define KISS_FTR_H
#include "kiss_fft.h"
#ifdef __cplusplus
extern "C" {
#endif
/*
Real optimized version can save about 45% cpu time vs. complex fft of a real
www.eeworm.com/read/140062/13112265
cpp twoff.cpp
void twofft(double data1[], double data2[], double fft1[],
double fft2[], int& n)
{
int j,n2,j2;
double c1r,c1i,c2r,c2i,conjr,conji,h1r,h1i,h2r,h2i;
c1r = 0.5;
c1i = 0.0;
c2r =