搜索资源列表
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
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
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
OceanCS
- FFT Based Ocean,Direct3D,Compute Shader,Ocean render
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
KeygenCircuitMakerV6.0Pro
- A Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex-number arithmetic to group the
LibProteus
- The FFT is based on decomposition and breaking the transform into smaller transforms and combining them to get the total transform. FFT reduces the computation time required to compute a discrete Fourier transform and improves the performance by a fa
ThamKhaoCodeCaAssembly
- The FFT is based on decomposition and breaking the transform into smaller transforms and combining them to get the total transform. FFT reduces the computation time required to compute a discrete Fourier transform and improves the performance by a fa
slau213a
- The FFT is based on decomposition and breaking the transform into smaller transforms and combining them to get the total transform. FFT reduces the computation time required to compute a discrete Fourier transform and improves the performance by a fa
FFT_CODE
- A fast Fourier transform (FFT) is an algorithm to compute the discrete Fourier transform (DFT) and its inverse. A Fourier transform converts time (or space) to frequency and vice versa an FFT rapidly computes such transformations. As a result, fast F
proposed_16
- FFT 4 stage radix 2 A fast Fourier transform is an algorithm to compute the discrete Fourier transform and its inverse. A Fourier transform converts time to frequency and vice versa-FFT 4 stage radix 2 A fast Fourier transform is an algorithm to com
FourierTransform
- 对图像进行二维快速傅立叶变换及傅立叶反变换，并输出图像的频谱图和相位图-Consult a reference book for Fast Fourier Transform (FFT), and then develop a program that can compute and display the two-dimensional Discrete Fourier Transform (amplitude and phase spectra) of a digital image.
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
contfft
- Use of FFT to compute Continuous-Time Fourier Transform
FFTW
- 使用FFTW VCL 和网上流行的C算法对已知函数各进行了FFT变换，同时使用IFFTW进行了反演，并将反演图像和原始图形进行了比较，结果是两种图形可以重合。-Use the FFTW VCL and the popular C FFT algorithm in th internet to compute the FFT