Description: 快速傅立叶变换算法中的分裂基算法，又称基2/4算法，对一维序列，这种算法使FFT比较完善-Fast Fourier Transform algorithm separatist base algorithm, also known as base 2/4 algorithm, the one-dimensional sequence, so FFT algorithm sound Platform: |
Size: 2048 |
Author:刘威 |
Hits:
Description: 用C语言实现的对基—2FFT算法的改进，提高了算法的运算速度-using the C language to the base-FFT algorithm, the algorithm improves the speed of operation Platform: |
Size: 3072 |
Author:zz |
Hits:
Description: 对FFT的基2频析型算法实现，对信号分析较为实用-Base 2 of the FFT frequency analysis type algorithm for signal analysis is more practical Platform: |
Size: 2048 |
Author:swjtuhy |
Hits:
Description: 数字信号处理（DSP）中快速傅立叶变换（基2）的算法。-Digital signal processing (DSP) in the Fast Fourier Transform (base 2) of the algorithm. Platform: |
Size: 1024 |
Author:kcamellia |
Hits:
Description: 在VC++中实现基2时间抽取的FFT（快速傅里叶变换）算法.-In VC++ In time taken to achieve the base 2 of the FFT (Fast Fourier Transform) algorithm. Platform: |
Size: 1024 |
Author:steven |
Hits:
Description: FFT算法的基本原理是把长序列的DFT逐次分解为较短序列的DFT。按照抽取方式的不同可分为DIT-FFT（按时间抽取）和DIF-FFT（按频率抽取）算法。按照蝶形运算的构成不同可分为基2、基4、基8以及任意因子（2n,n为大于1的整数），基2、基4算法较为常用。-FFT algorithm is the basic principle of DFT successive long sequence is broken down into shorter sequences of DFT. In accordance with the different extraction methods can be divided into the DIT-FFT (time taken) and the DIF-FFT (according to the frequency of extraction) algorithm. In accordance with the composition of different butterfly operations can be divided into base 2, base 4, base 8, as well as arbitrary factor (2n, n is an integer greater than 1), radix-2, Radix-4 algorithm is more commonly used. Platform: |
Size: 1024 |
Author:李文 |
Hits:
Description: 快速傅里叶分析的C算法程序，是基二FFT算法，内付简单使用说明。-Fast Fourier analysis of the C algorithm procedure is the base two FFT algorithm, with simple instructions to pay. Platform: |
Size: 3072 |
Author:廖于翔 |
Hits:
Description: 这个傅立叶实例算法使用了基2、基3、基4、基5、基8、基10……混合算法，几乎可以计算任意长度的FFT。说明白点也就是当序列长度n为2、3、5、7、11等这些比较小的素数时，或者n的最大素因数<=37时，可计算这个序列的FFT。-The Fourier algorithm uses an instance of the base 2, base 3, base 4, base 5, base 8, base 10 ... ... hybrid algorithm can calculate almost any length of FFT. Say clearly that that is when the sequence length n for 2,3,5,7,11 and so on these relatively small prime numbers, or when n, the largest prime factor "= 37 hours, calculate the sequence of the FFT. Platform: |
Size: 39936 |
Author:169 |
Hits:
Description: 快速Fourier变换的代码，基2算法，且和原始定义的Fourier变换算法进行了对比。-Fast Fourier Transform code, the base 2 algorithm, and the original definition of the Fourier transform algorithm were compared. Platform: |
Size: 2048 |
Author:lihousen |
Hits:
Description: 傅里叶变换的C程序，实现时域抽取的基2FFT，算法先对输入数据序列进行码位倒置，输出为正序-Fourier transform of C program, to achieve time-domain extraction of base 2FFT, algorithm on the input data sequence of first code bit inverted, the output for the positive sequence Platform: |
Size: 1024 |
Author:Zhi Xue Lei |
Hits:
Description: 有关DSP C6400 系列的FFT算法程序优化，有基2和基4法两种方法的C语言编程，还有对应的线性汇编程序。-The DSP C6400 series of FFT algorithm optimization, a base 2 and base 4 and French methods of the C programming language, as well as the corresponding linear assembler. Platform: |
Size: 10240 |
Author:陈群 |
Hits:
Description: 实现快速傅立叶变换的C程序代码，以基2FFT为基础的算法-Implementation of fast Fourier transform C program code, to base 2FFT based algorithm Platform: |
Size: 1024 |
Author:wuxinzhu |
Hits:
Description: 对采样信号进行FFT变换，并计算出频域的幅值。查看变量，生成FFT曲线图.基四频域FFT算法，CCS-FFT, the sampling signal and calculate the magnitude of the frequency domain. Viewing Variables, generate FFT graph. Base four frequency domain FFT algorithm, CCS Platform: |
Size: 18432 |
Author:金继仁 |
Hits:
Description: 设计一个按时间抽取的输入倒位序输出顺序的基2—fft算法程序。-Time taken by designing an inversion input sequence output sequence of the base 2-fft algorithm. Platform: |
Size: 1024 |
Author:qinxuan |
Hits:
Description: 任意偶数点数的fft，ifft快速计算.分别使用基2时间和基2频率的FFT算法，使用标号控制是否为IFFT。-Any even number of points fft, ifft quick calculations. Were using the base 2 times the frequency and the base 2 FFT algorithm, using the label control whether IFFT. Platform: |
Size: 2048 |
Author:张小虎 |
Hits:
Description: 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. Platform: |
Size: 9216 |
Author:zhuqianxia |
Hits:
Description: 这个代码利用时间抽取算法，编写基2点的快速傅立叶变换（FFT）程序。-This code takes advantage of the time extraction algorithm, written in base 2:00 Fast Fourier Transform (FFT) program. Platform: |
Size: 1024 |
Author:LDM |
Hits:
Description: 在VC++中实现基2时间抽取的FFT（快速傅里叶变换）算法.-In VC++ In time taken to achieve the base 2 of the FFT (Fast Fourier Transform) algorithm. Platform: |
Size: 2048 |
Author:he632760 |
Hits:
Description: 基于蝶形变换的FFT变换程序，以2为底，程序中使用了可快速计算蝶形序号的算法。-Based on the FFT butterfly transformation program, base 2, the program algorithm can quickly calculate the butterfly numbers to use. Platform: |
Size: 1024 |
Author:小田 |
Hits:
Search - fft base 2 algorithm