Location:
Search - fft complex
Search list
Description: 程序通过DSP来实现数字滤波FFT的功能-The program implements FFT with DSP
Platform: |
Size: 15360 |
Author: 胡龙 |
Hits:
Description: Basically, this article describes one way to implement the 1D version of the FFT algorithm for an array of complex samples. The intention of this article is to show an efficient and fast FFT algorithm that can easily be modified according to the needs of the user. I ve studied the FFT algorithm when I was developing a software to make frequency analysis on a sample of captured sound.-Basically, this article describes one way to implement the 1D version of the FFT algorithm for an array of co mplex samples. The intention of this article is to show an efficient and fast FFT algorithm that can easily be modified according to the needs of the user. I ve studied the FFT algorithm when I wa s developing a software to make frequency Analytics sis on a sample of captured sound.
Platform: |
Size: 27648 |
Author: 冰城 |
Hits:
Description: 基于tms320vc55*系列DSP常用算法，包括：
1. Experiment 7A - Radix-2 Complex FFT in C
2. Experiment 7B - Radix-2 Complex FFT in C55x Assembly Language
3. Experiment 7C - Radix-2 Complex FFT and IFFT
4. Experiment 7C - Fast Convolution
5. matlab 源码- Based on tms320vc55* series DSP commonly used algorithm,
including: 1. Experiment 7A- Radix-2 Complex FFT in C
2. Experiment 7B- Radix-2 Complex FFT in C55x Assembly
Language
3. Experiment 7C- Radix-2 Complex FFT and IFFT
4. Experiment 7C- Fast Convolution
5. matlab source code
Platform: |
Size: 78848 |
Author: |
Hits:
Description: 这是一基于MATLAB的复调制ZOOM-FFT的研究和实现的一篇文章，为的是提高频率分辨率。-This is a MATLAB-based complex modulation ZOOM- FFT Research and Implementation of an article, To improve the frequency resolution.
Platform: |
Size: 159744 |
Author: 陶陶 |
Hits:
Description: DIT-FFT算法子程序
FFT长度为2m，m为正整数。FFT输出结果放在输入复数数组中。其中xr存放信号序列实部，xi存放信号序列虚部。如果信号长度小于N，需要给xr和xi后面补足0，计算结果x(k)的实部和虚部仍然分别存放在数组xr和xi中。-DIT- FFT subroutine FFT length of 2m, m is a positive integer. FFT output on the importation of complex array. Xr which kept real signal sequence, the signal sequence xi kept the imaginary part. If the signal is less than the length of N, and the need to xr xi behind complement 0, The results of x (k) the real and imaginary parts were still stored in the array xr and xi China.
Platform: |
Size: 2048 |
Author: jia |
Hits:
Description: fft.c--This computes an in-place complex-to-complex FFT
x and y are the real and imaginary arrays of 2^m points.
dir = 1 gives forward transform
dir = -1 gives reverse transform -fft.c This computes an in-place complex-to-complex FFT x and y are the real and imaginary arrays of 2 ^ m points. dir = 1 gives forward transform dir =-1 gives reverse transform
Platform: |
Size: 1024 |
Author: jessie |
Hits:
Description: This computes an in-place complex-to-complex FFT
x and y are the real and imaginary arrays of 2^m points.
dir = 1 gives forward transform
dir = -1 gives reverse transform -This computes an in-place complex-to-complex FFT x and y are the real and imaginary arrays of 2 ^ m points. Dir = 1 gives forward transform dir =-1 gives reverse transform
Platform: |
Size: 1024 |
Author: jessie |
Hits:
Description: 16点FFT VHDL源程序，The xFFT16 fast Fourier transform (FFT) Core computes a 16-point complex FFT. The input data
is a vector of 16 complex values represented as 16-bit 2’s complement numbers – 16-bits for
each of the real and imaginary component of a datum.-16:00 FFT VHDL source code, The xFFT16 fast Fourier transform (FFT) Core computes a 16-point complex FFT. The input datais a vector of 16 complex values represented as 16-bit 2 s complement numbers- 16-bits foreach of the real and imaginary component of a datum.
Platform: |
Size: 1824768 |
Author: qiyuan |
Hits:
Description: Radix-2 Fast Fourier Transform, real or complex sin/cos transform
-Radix-2 Fast Fourier Transform, real or complex sin/cos transform
Platform: |
Size: 40960 |
Author: dai |
Hits:
Description: C实现Chirp-Z变化，采用Bluestein快速算法，压缩包内还附有FFT.h和Complex.h,很有应用价值-C implementation Chirp-Z changes, the use of fast algorithm Bluestein, compressed package also included FFT.h and Complex.h, great value
Platform: |
Size: 3072 |
Author: |
Hits:
Description: ti 的FFT 算法库,里面有PDF的理论基础,和算法库,很齐全,很有参考价值.-This FFT library contains generic FFT module (32-bit implementation) for real/complex FFT
Platform: |
Size: 780288 |
Author: vincent |
Hits:
Description: The code in this library contains an implementation for Fast
Fourier Transforms on arbitrary length complex data. It is based
on old FORTRAN code, found in a signal processing archive. I
dissected the FORTRAN code, since it worked with normal arrays
and I wanted everything to work with my own complex number
arrays. Also, I substituted a lot of old written out code with
much more readable procedures.
Platform: |
Size: 512000 |
Author: lzzealot |
Hits:
Description: Program FFT.FOR
This FORTRAN program calculates the fast Fourier transform of a
timeseries (real and/or complex) or the inverse Fourier transform
of spectral components (real and/or complex). The FFT is based
on the algorithm given in Numerical Recipes, Cambridge University
Press, 1994.-Program FFT.FOR
This FORTRAN program calculates the fast Fourier transform of a
timeseries (real and/or complex) or the inverse Fourier transform
of spectral components (real and/or complex). The FFT is based
on the algorithm given in Numerical Recipes, Cambridge University
Press, 1994.
Platform: |
Size: 71680 |
Author: 梦回 |
Hits:
Description: 2点的碟形算法，其中包含了旋转因子乘法器，这是一种高效的复数乘法器.-2point dish method, which includes the rotation factor multiplier, which is a highly efficient complex multipliers.
Platform: |
Size: 687104 |
Author: luping |
Hits:
Description: 基2FFT蝶形运算器，代码有仿真用数据。主代码用于仿真，碟形运算和复数乘法元件化-Based 2FFT butterfly, code with simulation data used. Master code for simulation, dish components of computing and complex multiplication
Platform: |
Size: 3072 |
Author: treeyellow |
Hits:
Description: 快速傅立叶变换（FFT）的FPGA实现,本系统采用了不同点数基2的复FFT。-Fast Fourier Transform (FFT) of the FPGA, the system uses two different points-based complex FFT.
Platform: |
Size: 595968 |
Author: xiaoming |
Hits:
Description: FFT 并不是一种新的变换，它是离散傅立叶变换（DFT）的一种快速算法。由于我们在计算DFT 时一次复数乘法需用四次实数乘法和二次实数加法；一次复数加法则需二次实数加
法。每运算一个X（k）需要4N 次复数乘法及2N+2（N-1）=2（2N-1）次实数加法。所以
整个DFT 运算总共需要4N^2 次实数乘法和N*2(2N-1)=2N(2N-1)次实数加法。如此一来，计算时乘法次数和加法次数都是和N^2 成正比的，当N 很大时，运算量是可观的，因而需要
改进对DFT 的算法减少运算速度。-FFT is not a new transformation, it is the discrete Fourier transform (DFT) of a fast algorithm. Since we have a complex multiplication when calculating DFT Xuyong four real multiplications and real additions secondary a complex quadratic addition Zexu real addition. Each operator of a X (k) requires 4N times complex multiplication and 2N+2 (N-1) = 2 (2N-1) times the real number addition. Therefore, the DFT computation requires 4N ^ 2 times in total real multiplications and N* 2 (2N-1) = 2N (2N-1) times the real number addition. Thus, when calculating the number of multiplications and additions and are proportional to N ^ 2, when N is large, the computation is considerable and, therefore, need to improve on the DFT algorithm to reduce computational speed.
Platform: |
Size: 404480 |
Author: 平意义 |
Hits:
Description: 基于TMS320C54x的FFT实现，从而掌握掌握8～1024点复数 C54x FFT程序的使用方法-TMS320C54x the FFT-based implementation to grasp the master 8 1024 point complex ' C54x FFT program to use
Platform: |
Size: 2048 |
Author: jlryry |
Hits:
Description: 接口为fft(complex *a, complex *b, int n)。a是输入，b是输出，n为长度-Interface fft (complex* a, complex* b, int n). a is the input, b is the output, n is the length
Platform: |
Size: 1024 |
Author: reddog |
Hits:
Description: 目前,在极高频率的电子装置或系统中不能采用数字信号处理的原因有两个:一是A/D转换器的速度不能达到足够快 二是信号处理任务太复杂,达不到实时处理的要求.-At present, in the high frequency of the electronic device or system cannot use the digital signal processing for two reasons: one is the A/D converter cannot reach the speed of fast enough Second is the signal processing tasks too complex, can not reach the real-time process requirements.
Platform: |
Size: 20480 |
Author: 飞翔 |
Hits: