搜索资源列表
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
fft_delphi
- A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse
FFT
- 计算快速fouries变换的c++源程序，即可计算正变换，又可计算逆变换！-it can compute the fouries transform of time series,in c++.it can also compute the inverse fouries transform.
computeMelSpectrum
- Compute the matrix of mel filter coefficients given the sampling frequency, the length of the FFT and the number of desired mel filter channels.
fft
- this fft header file for fast fourier transform. with this file, you can compute frequency spectrum zero to tow pi.-this is fft header file for fast fourier transform. with this file, you can compute frequency spectrum zero to tow pi.
Euler
- Euler方法 用C语言实现，并求解常微分方程组-The m framework appropriately generalizes notions such as gain margin, phase margin, disturbance attenuation, tracking, and noise rejection into a common framework suitable for analysis and design, in both single-loop and
Spectrum
- function [f,Py,w,fp,Pmax]=spectrum(ug,dt) spectrum Compute the one-sided psd from the power spectrum refer to the help of fft and periodgram.m. codied by Dr. Ping TAN June, 2005- function [f, Py, w, fp, Pmax] = spectrum (ug, dt) spectr
fftplot
- compute and/or plot the magnitude in dB and phase in degrees of the FFT data in Y
test2
- 可用于计算FFT 源码中已经写好主要的正余弦转换函数-can used to compute fft
fftofsignal
- this m file is fast Fourier transform (FFT).and is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse of recorded signal-this m file is fast Fourier transform (FFT).and is an efficient algorithm to compute the dis
chirp_z_test
- 利用快速卷积实现chirp-z计算，针对有限长序列和无限长序列。-chirp-z compute using fast fft-based convolution
GslComplex
- 利用gsl数学库计算FFT的类,还包含自己写的二维数组类为基类-using gsl compute FFT
fdvolfft
- Compute fractal dimensions FDS and intercepts ICS of a 3D image IM using FFT and draw rose plots of FDS and ICS
Myproject
- 快速傅立叶变换（FFT）是一个有效的算法来计算离散傅立叶变换（DFT）及其逆。有很多不同的FFT算法，涉及范围很广，从简单的复数运算的数学组理论和数字理论,这里我给大家带来了一个能够进行快速傅里叶变换及其逆的程序，希望对大家能够有所帮助-A Fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are
fft
- This a vhdl code written to compute fft for the values stored in a RAM. The fft values are stored in bit reversed order finally in the same RAM. Not sure if it is working 100 . For my test input it worked.-This is a vhdl code written to compute fft f
Barker_ambig
- 计算和绘制模糊函数的巴克码 计算模糊函数 利用FFT通过结合多个范围切-Compute and plot the ambiguity function for a Barker code Compute the ambiguity function by utilizing the FFT through combining multiple range cut
FFT_analysis
- A MATLAB program to compute FFT of the real-time signal obtained from DSO1100 oscilloscope.
cPPfft-time-test
- 在代码里设置M,N。N是2的M次方。计算长度为N的fft，以及他所消耗的时间-to compute a signal length N`s fft
toc
- A fast Fourier transform (FFT) is an algorithm to compute the discrete Fourier transform (DFT) and its inverse. Fourier analysis converts time (or space) to frequency and vice versa an FFT rapidly computes such transformations by factorizing the DFT
fft
- this code compute the fast fourier transform