搜索资源列表
wineryulmslvbo
- 构造一组被噪声污染的方波或三角波数据，试选取适当的FIR滤波器结构和参数，分别应用LMS,DFT/LMS和DCT/LMS算法来实现自适应滤波器，对改组数据进行滤波，并分析仿真结果。-Construction Group was one of the Noise Pollution square or triangular wave data, Examination choose appropriate FIR filter structure and parameters, applicat
FFT_CODE
- A fast Fourier transform (FFT) is an algorithm to compute the discrete Fourier transform (DFT) and its inverse. A Fourier transform converts time (or space) to frequency and vice versa an FFT rapidly computes such transformations. As a result, fast F
fft
- C语言实现几种不同FFT的方法：其中包括时间抽取的基2 DFT，频率抽取的基2 DFT，分裂基算法、CZT方法等。-C language implementation of several different FFT approach: including the time taken by the base 2 DFT, frequency extraction base 2 DFT, split based algorithm, CZT methods.
STC_FFT
- 快速傅里叶变换法（FFT）是离散傅立叶变换的一种快速计算方法，它能使N点DFT的乘法计算量由N2 次降为 次。下图是采样点数为8点FFT时间抽取算法信号流图，本程序也是以这种形式设计的。-Fast Fourier Transform (FFT) is a fast computational method for discrete Fourier transforms that can reduce the multiplication of N-point DFT by N2 times. T
并行计算MPI程序设计
- FFT，即为快速傅氏变换，是离散傅氏变换的快速算法，它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。它对傅氏变换的理论并没有新的发现，但是对于在计算机系统或者说数字系统中应用离散傅立叶变换，可以说是进了一大步。(FFT, that is fast Fourier transform, is a fast algorithm for discrete Fourier transform. It is based on the odd, even, imaginar