Description: 一篇用VHDL实现快速傅立叶变换的论文,包括原理分析和代码实现,印度圣雄甘地大学M.A.学院提供-VHDL with a Fast Fourier Transform papers, including the principle of analysis and implementation of the code, the Mahatma Gandhi Institute of the University of Marat Platform: |
Size: 62464 |
Author: |
Hits:
Description: 快速傅立叶变换的C源代码,可以移植到各种8位-32位的单片机上-Fast Fourier Transform C source code can be transferred to various 8-bit MCU-32 on Platform: |
Size: 27648 |
Author:张三 |
Hits:
Description: This document introduces the techniques of fast Fourier transform and gives a source code in C for computing 2D FFT on image data. Platform: |
Size: 30720 |
Author:冰城 |
Hits:
Description: This program produces a Frequency Domain display from the Time Domain data input using the Fast Fourier Transform.
-This program produces a Frequency Domain display from the Time Domain data input using the Fast Fourier Transform. Platform: |
Size: 7168 |
Author:张三丰 |
Hits:
Description: This function spatially filters an image, using the Fast Fourier transform and a user-supplied frequency filter function. The filter must be real (amplitude only) and bilaterally symmetric. Platform: |
Size: 32768 |
Author:fei |
Hits:
Description: 快速傅里叶变换FFT通用matlab源程序,众所周知,matlab工具箱里的fft函数是内置的,我们无法看到其源代码,为了学习交流方便,特帖出本人以前用matlab语言写的fft通用matlab源程序,以供初学者学习参考之用!-FFT fast Fourier transform common Matlab source, as we all know, the Matlab toolbox fft function is built-in, we can not see the source code, in order to facilitate the exchange of learning and special TIE out I used to write using the Matlab language fft common source Matlab, for beginners to learn reference only ! Platform: |
Size: 1024 |
Author:刘鹏 |
Hits:
Description: 快速傅利叶变换 C 语言源代码,关于傅立叶变换的-Fast Fourier Transform C language source code on the Fourier transform Platform: |
Size: 16384 |
Author:大海 |
Hits:
Description: 1.通过实验加深对快速傅立叶变换(FFT)基本原理的理解。
2.了解FFT点数与频谱分辨率的关系,以及两种加长序列FFT与原序列FFT的关系。
离散傅里叶变换(DFT)和卷积是信号处理中两个最基本也是最常用的运算,它们涉及到信号与系统的分析与综合这一广泛的信号处理领域。实际上卷积与DFT之间有着互通的联系:卷积可化为DFT来实现,其它的许多算法,如相关、滤波和谱估计等都可化为DFT来实现,DFT也可化为卷积来实现。-1. Deepen the experimental fast Fourier transform (FFT) the basic tenets of understanding. 2. Understand the FFT spectrum and points of the resolution, and two extended sequence with the original FFT FFT relations. Discrete Fourier Transform (DFT) and the convolution of two signal processing is the most commonly used basic arithmetic, they relate to the signal and system analysis and synthesis of the wide range of signal processing field. DFT actually convolution and interoperability between contact : DFT into convolution can be achieved in many other algorithms, If relevant, filtering and spectral estimation could be achieved as DFT, DFT into convolution can be achieved. Platform: |
Size: 3072 |
Author:深蓝 |
Hits:
Description: 使用C语言详细实现了两种不同的快速傅立叶变换算法,可以清楚地理解算法原理。-use of C language in detail to achieve two different fast Fourier transform algorithm, we can clearly understand algorithm principle. Platform: |
Size: 2048 |
Author:yangtao |
Hits:
Description: 文件包为浮点快速傅立叶变换(32点)的汇编代码,运行在ADI的Visual DSP++平台上,由于结合了并行流水线指令,该算法具有很高的运行效率,可以被广泛使用在高速数字信号处理方面。-package for floating-point fast Fourier transform (32 points) compiled code, ADI operations in the Visual DSP platform, thanks to a combination of a parallel pipelined instructions, The algorithm has high operating efficiency and can be widely used in high speed digital signal processing. Platform: |
Size: 502784 |
Author:傅峰 |
Hits:
Description: 快速傅立叶变换的程序,附有试验用数据,希望对大家有所帮助-Fast Fourier Transform procedure, with test data, and they hope to help everyone Platform: |
Size: 2048 |
Author:johnny zhang |
Hits:
Description: 快速傅利叶变换 C 语言源代码,可以很好移植到不同的系统-Fast Fourier Transform C language source code, can be ported to different systems Platform: |
Size: 16384 |
Author:quinn yang |
Hits:
Description: 用c实现的快速傅立叶变换算法,用作频谱分析-With c realize the fast Fourier transform algorithm for spectral analysis Platform: |
Size: 1024 |
Author:朋友 |
Hits:
Description: 快速傅里叶变换(FFT)算法。FFT - Fast Fourier transform. The length of X must be a power of two, for a fast radix-2 fast-Fourier transform algorithm is used-Fast Fourier Transform (FFT) algorithm. FFT- Fast Fourier transform. The length of X must be a power of two, for a fast radix-2 fast-Fourier transform algorithm is used Platform: |
Size: 1024 |
Author: |
Hits: