Description: 快速傅里叶变换FFT通用matlab源程序,众所周知,matlab工具箱里的fft函数是内置的,我们无法看到其源代码,为了学习交流方便,特帖出本人以前用matlab语言写的fft通用matlab源程序,以供初学者学习参考之用!-FFT fast Fourier transform common Matlab source, as we all know, the Matlab toolbox fft function is built-in, we can not see the source code, in order to facilitate the exchange of learning and special TIE out I used to write using the Matlab language fft common source Matlab, for beginners to learn reference only ! Platform: |
Size: 1024 |
Author:刘鹏 |
Hits:
Description: 1.通过实验加深对快速傅立叶变换(FFT)基本原理的理解。
2.了解FFT点数与频谱分辨率的关系,以及两种加长序列FFT与原序列FFT的关系。
离散傅里叶变换(DFT)和卷积是信号处理中两个最基本也是最常用的运算,它们涉及到信号与系统的分析与综合这一广泛的信号处理领域。实际上卷积与DFT之间有着互通的联系:卷积可化为DFT来实现,其它的许多算法,如相关、滤波和谱估计等都可化为DFT来实现,DFT也可化为卷积来实现。-1. Deepen the experimental fast Fourier transform (FFT) the basic tenets of understanding. 2. Understand the FFT spectrum and points of the resolution, and two extended sequence with the original FFT FFT relations. Discrete Fourier Transform (DFT) and the convolution of two signal processing is the most commonly used basic arithmetic, they relate to the signal and system analysis and synthesis of the wide range of signal processing field. DFT actually convolution and interoperability between contact : DFT into convolution can be achieved in many other algorithms, If relevant, filtering and spectral estimation could be achieved as DFT, DFT into convolution can be achieved. Platform: |
Size: 3072 |
Author:深蓝 |
Hits:
Description: 快速傅立叶变换的程序,附有试验用数据,希望对大家有所帮助-Fast Fourier Transform procedure, with test data, and they hope to help everyone Platform: |
Size: 2048 |
Author:johnny zhang |
Hits:
Description: Generation of signal with extra parameters
Detection using
Fast Fourier Transform Algorithm
Goertzel Algorithm
Digital Filtering (FIR Filter bank)
Platform: |
Size: 63488 |
Author:dairy |
Hits:
Description: 采用快速傅立叶变换(fft) 对图像进行配准的标准程序(matlab语言)-Using fast Fourier transform (fft) of the image registration of the standard procedures (matlab language) Platform: |
Size: 7168 |
Author:王兴广 |
Hits:
Description: Using the function to sample the voice signal and achieve fast Fourier transform in MATLAB, and then get the signal characteristics of the spectrum.Filtering the signal from the filter,and then playback the signal of voice Platform: |
Size: 72704 |
Author:林霞 |
Hits:
Description: 快速傅立叶变换(FFT)算法实现
将DFT算法与FFT算法计算时间进行比较,分析二者的效率和精确差异。-Fast Fourier Transform (FFT) algorithm to DFT algorithm and FFT algorithm for computing time to carry out comparative analysis between the two differences in the efficiency and precision. Platform: |
Size: 16384 |
Author:张帅 |
Hits:
Description: The frequency domain plays an important role in image
processing to smooth, enhance, and detect edges of images. Although
image data typically does not include imaginary values, the fast Fourier
transform (FFT) has been used for obtaining spectra. In this paper,
the fast Hartley transform (FHT) is used to transform two-dimensional
image data. Because the Hartley transform is real valued, it does
not require complex operations. Both spectra and autocorrelations of
two-dimensional ultrasound images of normal and abnormal livers were
computed. Platform: |
Size: 4096 |
Author:archit |
Hits:
Description: 快速傅里叶变换, 频谱的泄露,混叠误差实例的matla程序。-Fast Fourier Transform: In order to reduce the number of DFT calculations of a fast algorithm. Platform: |
Size: 67584 |
Author:邱颖 |
Hits:
Description: This program is open source code of fast Fourier transform in matlab.
Where y is the input argument and p is the normalized size of the input. Let
y = [1 2 3 4 ]
x= length(y)
m= log2(x)
p= ceil(m)
To call the function use
ft2(y,p) -This program is open source code of fast Fourier transform in matlab.
Where y is the input argument and p is the normalized size of the input. Let
y = [1 2 3 4 ]
x= length(y)
m= log2(x)
p= ceil(m)
To call the function use
ft2(y,p) Platform: |
Size: 1024 |
Author:ry |
Hits:
Description: 二维傅里叶变换,对图像进行二维傅里叶变换处理-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 capabilities to:
(a) Multiply the input image by (-1)x+y to center the transform for filtering.
(b) Multiply the resulting (complex) array by a real function (in the sense that the
the real coefficients multiply both the real and imaginary parts of the transforms).
Recall that multiplication of two images is done on pairs of corresponding elements.
(c) Compute the inverse Fourier transform.
(d) Multiply the result by (-1)x+y and take the real part.
(e) Compute the spectrum. Platform: |
Size: 1024 |
Author:solo |
Hits: