搜索资源列表
-
0下载：
fft.c - fast Fourier transform and its inverse (both recursively)
-
-
0下载：
离散序列的傅立叶变换与逆变换C语言编程实验-Discrete Fourier transform sequence with the inverse transform C language programming experiment
-
-
0下载：
DSP中进行的傅里叶变换程序。它包含了正变换和逆变换两种，可以多次条用。-DSP in the Fourier transform procedure. It contains transform and inverse transform are the two can be used many times.
-
-
0下载：
用VC实现DSP的完整程序，可以进行快速傅里叶变换及反变换-DSP with the VC to achieve a complete program that allows fast Fourier transform and inverse transform, etc.
-
-
0下载：
此本书介绍了数字信号处理的基本方法，用傅里叶和其逆变换对他分析了。-This book introduces the basic methods of digital signal processing, and its inverse Fourier transform on his analysis.
-
-
0下载：
采用基于FPGA的频域加窗与反傅立叶变换的数字幅频均衡功
率放大器:此方案采用高速FPGA，以及配套的高速AD、DA 对信号进行采样，傅
立叶变换，在频域上对信号进行加窗操作，然后通过傅立叶反变换将波形还原。
以得到需要的频谱幅度。-FPGA-based frequency domain using the windowed Fourier transform with the number of pieces of anti-band equalizer amplifier: Th
-
-
0下载：
快速复利叶变换与反变换的C语言编程，仅供大家参考-Rapid compounding the Fourier transform and inverse transform C programming language, for your reference
-
-
0下载：
IDFT就是Inverse Discrete Fourier Transform 离散傅里叶逆变换。-IDFT is the Inverse Discrete Fourier Transform The inverse discrete Fourier transform.
-
-
0下载：
A Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex-number arithmetic to group the
-
-
0下载：
快速傅里叶反变换的verilog源码程序，512点，适用于Quartus2开发环境。-Inverse fast Fourier transform Verilog source programs, 512, for development environment Quartus2.
-
-
0下载：
可进行快速傅立叶变换，可显示快速傅立叶变换和逆变换结果-For fast Fourier transform, fast Fourier transform and to display the results of the inverse transform
-
-
0下载：
使用TMS320F28335实现快速傅立叶变换(Fast Fourier Transform).可以将时域信号变换为频域，从而可以从频域分析处理信息，得到的结果再由傅立叶逆变换到时域分析。-using TMS320F28335 for fast Fourier transform (Fast Fourier Transform). Time domain signal can be transformed into the frequency domain, which can process
-
-
0下载：
傅立叶变换与傅立叶逆变换，使用的是整型数据。一次变换时间15MS左右，正反变换30MS左右。已经在STM32F1系列（因为没有浮点运算，只能整型运算。）的上运行测试OK。-
Fourier transform and inverse Fourier transform, using integer data. A transition time around 15MS, transform pros around 30MS. Has STM32F1 series (because there
-
-
0下载：
this folder contains the code for inverse fast fourier transform and the inverse dft. hope it helps. along with it it has several problem statements
-
