搜索资源列表
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
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.
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
fdvolfft
- Compute fractal dimensions FDS and intercepts ICS of a 3D image IM using FFT and draw rose plots of FDS and ICS
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.
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
fftshow
- Display fft. A fast Fourier transform (FFT) is an algorithm to compute the discrete Fourier transform (DFT) and its inverse.
sp_gram
- gram - 计算信号向量的频谱图 ％ ％[B，F，T] 频谱图（xx，Nfft，fs，窗口，Noverlap） ％ ％输出： ％B 谱图值 ％F 来自FFT的分析频率（Hz） ％T 窗口位置时间（秒）- gram compute the spectrogram of a signal vector [B,F,T] spectrogram(xx,Nfft,fs,window,Noverlap ) Outputs:
abc
- 比较DFT和FFT的运算时间。（1）自行选择进行计算的序列（或产生随机序列）。 （2）利用计时函数tic、toc，计算点数N=64、128、256、……(IT IS A SAMPLE.Compare the computing time of DFT and FFT. (1) select the sequence to compute (or generate random sequences). (2) using the timer functions tic and TOC to c