搜索资源列表
radix-2FFT
- 基2FFT,是DFT(离散傅立叶变换)的快速算法-radix 2 FFT, DFT (Discrete Fourier Transform) Fast Algorithm
2fft
- 基于802.16d的OFDM下基2FFT的源码，供初学者参考！
radix-2FFT
- 基2FFT,是DFT(离散傅立叶变换)的快速算法-radix 2 FFT, DFT (Discrete Fourier Transform) Fast Algorithm
2FFandIFFT
- 时间抽选基2FFT及IFFT算法C语言实现-time selected radix 2 FFT and IFFT algorithm C Language
fft
- matlab编写的基-2fft快速付里叶算法程序，输入倒位序，输出自然顺序。-Matlab prepared by the base-2fft fast Fourier algorithm procedures inversion input sequence, Output of natural order.
2fft
- 基于802.16d的OFDM下基2FFT的源码，供初学者参考！-802.16d based on the OFDM-based 2FFT under the source, the reference for beginners!
mm
- 此文档中主要说明了基于Matlab的时间抽取基2FFT算法的一些注意事项以及程序是可行的。-In this document mainly describes the time taken based on the Matlab-based algorithm 2FFT some attention as well as the procedure is feasible.
DIT_base0n2_FFT
- 时间抽取(DIT)基2FFT算法: 输入:先输入数组长度(8,16,32...),再输入数组内容. 输出:FFT变换结果.-Time taken (DIT) based 2FFT algorithm: Input: enter the array length (8,16,32 ...), and then type the array elements. Output: FFT transform results.
myfft
- myfft.m 实现对任意长度一维数组的基2FFT计算-myfft.m to achieve for any length of one-dimensional array-based computing 2FFT
2fftmatlab
- 基2fft的matlab程序，是比较简单的一种算法-2fft the matlab-based procedures, is a relatively simple algorithm
2fft
- matlab实现基2fft按时间抽取，输入倒位序，输出顺序 -matlab achieve time-based 2fft extraction, inversion input sequence, output sequence
fft_v0.5.6.1
- 快速傅里叶变换fft算法，基于时间的基2fft，其中针对ARM7 TDMI优化，采用查表的方式- Fast Fourier Transform algorithm, based on time-based 2fft, one optimized for ARM7 TDMI, using look-up table approach
2fft
- 基2FFT算法实现改进的一篇很好的文章,有利于傅立叶变换的理解-2FFT-based algorithm to improve a very good article, and is conducive to the understanding of Fourier Transform
fft
- 基2fft,实现对实数序列的离散快速傅里叶变换-Based 2fft, the realization of the real sequence of discrete Fast Fourier Transform
dspfftv2
- dsp上的基2fft快速算法，在5502上测试通过-2-base fft algrithm ,tested in 5502 dsp
lastce
- 整形基2fft算法的C语言实现，包括蝴蝶算法和倒序重排等-fft dct
Base2FFT
- 基2FFT程序，已在DSP实验箱上运行通过，希望对大家有帮助-Base 2FFT procedures, has been running in the DSP test cases passed, want to help everyone
exp2_FFT_DIT
- 设计一个按照时间抽取的基2快速傅里叶变换（基2FFT-DIT）。输入倒位序，输出自然顺序。-To design a time of extraction according to the base 2 Fast Fourier Transform (base 2FFT-DIT). Input inversion sequence, the output natural order.
fft
- 设计一个按照时间抽取的基2快速傅里叶变换（基2FFT-DIT）。输入倒位序，输出自然顺序-To design a time of extraction according to the base 2 Fast Fourier Transform (base 2FFT-DIT). Input inversion sequence, the output of natural order。
j2fft
- 实现基2FFT的算法，包括数据分析报告，Matlab实现界面友好。-To achieve the base 2FFT algorithms, including data analysis, Matlab to achieve user-friendly.