搜索资源列表
real_squence2N_fft
- 2N点实序列FFT_C程序 上《数字信号处理》课程时编的-2N-point real sequence FFT_C procedural Digital Signal Processing course series
FFTalgorithmCprogram
- 序执行时要求输入序列的长度N_pre，N_pre 是最初输入序列的长度，任意长度都可以。N是指补零后的序列长度，满足2^L. 然后逐个输入各个元素的实部和虚部，补零部分不必输入。 显示FFT变换的结果。-Order execution when the input sequence length requirements N_pre, N_pre are the initial input sequence length, can be of any length. N refers
fft2048
- 2048点实序列fft 采用优化地方法节省存储空间和运算时间。包括2048点实序列fft，信号幅度谱分析和排序。本程序用于基于tms320lf2407的波形采集与分析上，能够精确分析信号的幅度和频率分量。-2048-point sequence is optimized to fft method used to save storage space and computing time. Including the 2048-point real sequence fft, signal am
fft
- 基2fft,实现对实数序列的离散快速傅里叶变换-Based 2fft, the realization of the real sequence of discrete Fast Fourier Transform
FFT(DFTrealarray)threedimension
- 多维傅里叶变换，二维DFT快速算法，共分五部--五：三维实序列3D-DFT快速算法-Multi-dimensional Fourier transform, fast algorithm for two-dimensional DFT is divided into 5- 5: Three-dimensional real sequence of 3D-DFT Fast Algorithm
fftbianhuan
- 实现了一维实序列的fft变换，有随机数产生函数、补零函数，返回值放在一个复数数组中，并有取模运算。-Achieved on the real sequence of fft transform, there are random number generator function, zero fill function, the return value in a complex array, and a modulo operation.
FFT-algorithm
- 实际中需做快速傅里叶变换(FFT)的多为实序列数据，而其变换算法都是以复数序列 作为输入。文中利用频域的性质．将实序列数据变换为复数序列，再进行FFT变换，以提高FFT对于实序列输入的变换效率，最后用C语言实现该算法并与传统算法进行实验对比，从结果可看到优化后效率提高很多。-FFT algorithm with complex sequences as input is commonly applied to real sequence．A new FFT algorithm is pr
fft
- 一种实序列FFT新算法与C语言实现FFT of a real sequence and the C language implementation of new algorithms-FFT of a real sequence and the C language implementation of new algorithms
A-New-FFT-Algorithm
- 实际中需做快速傅里叶变换(FFT)的多为实序列数据，而其变换算法都是以复数序列作为输入。文中利用频域的性质，将实序列数据变换为复数序列，再进行FFT 变换，以提高FFT对于实序列输入的变换效率，最后用C 语言实现该算法并与传统算法进行实验对比，从结果可看到优化后效率提高很多。-Practice to be done fast Fourier transform (FFT) for the implementation of multi-sequence data, and its transfo
FFT-real
- 实序列的FFT算法 当isign=1时,对实序列data[1..n]做FFT, 返回正频率的系数保存在data[1..n]中 当isign=-1时,对实序列做IFFT,所得结果乘以2/n为原序列 n必须为2的幂-//The real sequence of FFT algorithm// When isign = 1, the sequence of real data [1 .. n] do FFT,// Return positive freq
FFT_NCompl_2NReal_float
- 程序 FFT_NCompl_2NReal_float 是用 *N点复序列FFT* 来计算 *2N点实序列* 离散傅立叶变换的函数。其中复序列FFT变换用到基2浮点DIT的算法程序。-Program FFT_NCompl_2NReal_float is* N point complex sequence to calculate the FFT** 2N point real sequence* Discrete Fourier Transform function. Complex sequen
rfft
- 计算实序列的快速傅里叶变换，它比复序列FFT算法大约可减少一半的运算量和存储量。-Calculate the real sequence of the fast Fourier transform, which is the time taken by the sequence of the base 2 FFT algorithm, it is more than complex sequence FFT algorithm can be roughly halved the amount o
DFT-and-FFT
- 用c#实现实序列的DFT和FFT变换，DFT与FFT均为自己编写-With c# Realize the real sequence of DFT and FFT transform, DFT and FFT are themselves prepared
FFT
- Function Descr iption: This function is generic fast Fourier transform C language function, portability, and the following sections failing Lai hardware. This function takes the form of a
FFT
- 此函数是通用的快速傅里叶变换C语言函数，移植性强，以下部分不依 赖硬件。此函数采用联合体的形式表示一个复数，输入为自然顺序的复 数（输入实数是可令复数虚部为0），输出为经过FFT变换的自然顺序的 复数 -This function is a generic fast Fourier transform C language function, strong transplantation, the following section is not dependent on
real-signal-fft
- 实序列FFT快速算法，用N点FFT计算2N点实序列的FFT，比直接进行2N点FFT运算减少一半运算量。-Real sequence FFT fast algorithm, using N-point FFT calculation 2N point real sequence of FFT, than the direct 2N-point FFT computation halved.
FFT-C
- DIT、FFT 算法的基本思想分析，实数蝶形运算算法的推导以及倒位序算法分析-DIT, the basic idea of FFT algorithm analysis and inversion algorithm sequence deduced real butterfly algorithm analysis
MyFFT
- 基于C语言的任意n点FFT算法实现。可自动实现16位以内的位倒序。输入实数数列，输出复数数列。-The realization of arbitrary point n C language based on FFT algorithm. Bit reverse more than 16 can automatically realize. In real sequence, the output of complex numbers.
DIT-DIF
- 对要求的2种实数序列进行基2－DIT和基2－DIF FFT变换-Base 2-DIT and the base 2-DIF FFT transform is required for two kinds of real sequence
rfft
- Real sequence of Fourier transform 实序列傅立叶变换 已验证 用N点FFT计算2N点实序列的FFT，比直接进行2N点FFT运算减少一半运算量 -Real sequence of Fourier transform verified with N points FFT calculation sequence of 2 N point FFT, than half 2 N point FFT operation to reduce computational