搜索资源列表
LFM-FFT
- 程序给出了线性调频信号时域波形以及频谱仿真-Procedures given chirp signal time-domain waveform and spectrum simulation
fft5
- 在matlab下实现fft并绘制出图形 傅里叶变换 快速傅里叶变换-Under matlab fft and draw the graph Fourier Transform Fast Fourier Transform
FFT
- 本程序的基本功能是对信号进行傅里叶变换，并同时提取出他的时域和频域的特征值。-The basic function of this program is the signal to Fourier transform, and the simultaneous extraction of his time domain and frequency domain characteristic values.
LS_FFT
- 相位解缠是INSAR数据处理的重要步骤，本文用基于FFT的最小二乘法实现实现相位解缠-Phase unwrapping
wavelet-methods-
- 讲述了现在机械故障诊断中用到的常用时频分析方法，如短时fft 魏格纳维尔分布 小波变换 HHT等，里面含有例子和详细说明，对初学者帮助很大。-Tells the now commonly used in mechanical fault diagnosis frequency analysis methods, such as short-time wavelet transform fft Wigner distribution HHT Louisville, etc., which cont
ca_fft
- 模拟GPS卫星L1频段的信号进行fft运算。-L1-band GPS signal analog satellite fft operations.
KFFT
- 计算离散傅里叶变换的一种快速算法，简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少，特别是被变换的抽样点数N越多，FFT算法计算量的节省就越显著。-A computing discrete Fourier transform fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by the JW Cooley and TW T
multi-verilog
- 乘法器。fft。 基2.蝶形运算。旋转因子-Multipliers. fft. Group 2 butterfly. Twiddle factor
FFT8
- xilinx FFT complete code book can be designed with reference to the FFT
lab45-FFT-FIR
- 快速傅里叶变换的c程序，同时加入FIR滤波器程序，调试成功-Fast Fourier Transform c program, while adding FIR filter program, the successful commissioning
FFT
- 利用DSP的高速处理速度，TI官方傅立叶变换库函数，最基本的点数可以用。例如 36,64,128-The use of high-speed DSP processing speed, TI official Fourier transform library functions and basic points can be used. For example 36,64,128
CODE
- for solving factoriel FFT and -for solving factoriel FFT and ...
Baseline-Filters-ECG
- This Matlab program filters the baseline drift in ECG signals using different techniques: - median filtering - moving average filtering - first order Kalman Smoother Filter - first order zero-phase Lowpass filter - Bandpass filter using
pipelined_fft_128_latest.tar
- CFFT是一个数据宽度和点数都可配置的基4 FFT core，由于旋转因子是用CORDIC算法实现的，因此经过FFT后信号的增益和标准的FFT算法不同。但对于OFDM调制、解调等应用并不重要。由于增益是确定的，因此在输出时乘以确定常数即可等价标准的FFT。该FFT core的输入是正序的，输出是按照基4反序的-CFFT is a data width and number can be configured based 4 FFT core, due to the rotation factor
fft
- 可以用于快速傅里叶变换，实数、复数都适合。正余弦变换-Radix-2 Fast Fourier Transform, real or complex sin/cos transform
fft
- 基于DSP2812的快速傅里叶变换，非常好用，不容错过！！你值得拥有-DSP2812-based Fast Fourier Transform, very easy to use, not to be missed! ! You deserve to have
rfft
- Real sequence of Fourier transform 实序列傅立叶变换 已验证 用N点FFT计算2N点实序列的FFT，比直接进行2N点FFT运算减少一半运算量 -Real sequence of Fourier transform verified with N points FFT calculation sequence of 2 N point FFT, than half 2 N point FFT operation to reduce computational
FFT2_test
- 基于基2的蝶型FFT，用C实现，经过测试，没有错误，可以直接拿去使用。-Based on base 2 FFT butterfly type, use C implementation, after testing, there is no error, can be directly used.
srfft_test
- 基于分裂基的蝶型FFT，用C实现，经过测试，没有错误，可以直接拿去使用。-Based on the division of FFT butterfly type, use C implementation, tested, no error, can directly use.
simpleCUFFT
- CUDA实现FFT，书中源码，大大加快了FFT的计算速度-CUDA FFT realization, the book source code, greatly speed up the calculation of the FFT