搜索资源列表
fft
- 傅里叶变换C++ 实现 将时域信号转化为频域信号-Fourier transform C++ time domain signal into a frequency domain signal
dit-fft.c
- 快速傅里叶变换（FFT）。允许输入任意长度（满足等于2的N次幂即可）。-Implementation of the Fast Fourier Transformer.
DFT
- 实现傅里叶变换，数据以txt文本形式给出，运行程序最终分解成幅值和相位，然后以txt文本形式输出-fft，transfer data to amplitude an phase
FFT
- 其中的函数FFT用于计算一组数据的快速傅里叶变换，输入参数为一个数组，元素个数为2的n次方。程序包含FFT排序算法和蝶形运算。-Function which Fast Fourier Transform FFT calculation for a set of data, the input parameters for an array of n number of elements in a power of 2. Program includes sorting algorithms an
FFT
- 大学时代写的傅里叶变换算法，可作为学习参考之用-The Fourier transform algorithm of the university age can be used as the reference for learning
short-fft
- 根据卷积定理，两个相乘序列的傅里叶变换等于它们各自傅里叶变换的卷积，加以实现。-According to the convolution theorem, the Fourier transform of the two multiplication sequences is equal to the convolution of their respective Fourier transforms.