搜索资源列表
Floating-point-complex-radix-2-decimation-in-time-
- 浮点复数基2时分FFT完成适当的FFT，输出改写输入缓冲器。-floating-point complex FFT-based two hours to complete the FFT output rewritten input buffer.
x28x_FFT
- TI的x28x系列芯片的FFT源程序。有128/256/512/1024点的实数和复数的FFT算法。-TI's chip x28x series of FFT source. 128 / 256/512/1024 point real and complex FFT algorithm.
FFT2D.rar
- 1维和2维快速傅里叶变换，网上广为流传的英文版本,1-D and 2-D Fast Fourier Transform， Perform a 2D FFT inplace given a complex 2D array
first
- 二维傅里叶变换,对图像进行二维傅里叶变换处理-Two-Dimensional Fast Fourier Transform The purpose of this project is to develop a 2-D FFT program "package" that will be used in several other projects that follow. Your implementation must have the capabilitie
CZT
- 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
dit_fft
- 本程序包括：DFT（离散傅里叶变换），FFT（快速傅里叶变换），IFFT（快速傅里叶逆变换），conv（卷积：圆周卷积、线性卷积），主要应用于信号处理，既可以对实序列做上述操作，也可以对复序列。-This process includes: DFT (Discrete Fourier Transform), FFT (fast Fourier transform), IFFT (inverse fast Fourier transform), conv (convolution: circula
1024FFT_ASIC
- 1024点复数专用FFT处理器的ASIC实现-1024 point complex FFT processor dedicated ASIC realization
useoffft
- 1）已知2N点实数序列 N=64。用一个64点的复数FFT程序，一次算出 ，并绘出频谱 。 （2）已知某序列 在单位圆上的N=64等分样点的Z变换 。用N点IFFT程序计算 ，绘出图像 。 -1) known 2N-point sequence of real numbers N = 64. With a 64-point complex FFT process, a calculated and mapped the spectrum. (2) known to a cer
fft
- Radix-2 Fast Fourier Transform, real or complex sin/cos transform -Radix-2 Fast Fourier Transform, real or complex sin/cos transform
fft
- ti 的FFT 算法库,里面有PDF的理论基础,和算法库,很齐全,很有参考价值.-This FFT library contains generic FFT module (32-bit implementation) for real/complex FFT
FFT(DFTcomplexarray)twodimension
- 多维傅里叶变换，二维DFT快速算法，共分五部--二：二维复序列行列算法-Multi-dimensional Fourier transform, fast algorithm for two-dimensional DFT is divided into 5- 2: two-dimensional complex sequence algorithm ranks
FFT(DFTcomplexarray)threedimension
- 多维傅里叶变换，二维DFT快速算法，共分五部--四：三维复序列3D-DFT快速算法-Multi-dimensional Fourier transform, fast algorithm for two-dimensional DFT is divided into 5- 4: Three-dimensional complex sequence of 3D-DFT Fast Algorithm
fft
- 对正弦信号进行傅里叶变化，然后估计频率，在不同信噪比下画出均值方差的图-In the data process the measured complex time signal is converted into frequency signal by DFT to get vibration information regarding frequency and amplitude of the rotor
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
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
- 离散快速Fourier变换，适用于复系数.-Discrete fast Fourier transform for complex coefficients.
FFT-Algorithm
- 本例通过VC实现二维快速傅里叶变换，涉及到进行矩阵、复数等数学运算，运用了C语言动态内存分配、文件操作、结构指针的函数调用等内容。-In this case through the VC to achieve two-dimensional fast Fourier transform, related to the matrix, such as complex mathematics, use the C language, dynamic memory allocation, file o
fft
- 接口为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
log_psd
- This function takes the n time domain samples (real or complex) and finds the psd by taking (fft/n)^2. The two sided spectrum is produced by shifting the psd The array freq provides the appropriate frequency values for plotting purposes.
FFTandTestInBCB
- FFT算法用标准C++实现，具有实数FFT变换函数、复数FFT变化函数，以及频谱分析功能。并给出了该算法在C++Builder环境下测试代码。-This file contains a few FFT routines, including a real-FFT routine that is almost twice as fast as a normal complex FFT, and a power spectrum routine when you know you d