文件名称:FastFourierTransform
介绍说明－－下载内容均来自于网络，请自行研究使用
This function is written to understand and/or explain an fft algorithm and usage of radix2 procedure.
This function take the signal which you want to find FFT, for m bit
you can also call the function without entering a signal or number of points, because there is default values for y and m which are
y = sin(2*pi*50*t)+sin(2*pi*120*t)
m=3
you can see the steps of order reversing used as built-in function but non others. you will also see the taking butterfly tree steps.
for more information read the help file of function.
in future this can be improve as selective radix or any other feature you suggest please notice me for any sugestion.
This function take the signal which you want to find FFT, for m bit
you can also call the function without entering a signal or number of points, because there is default values for y and m which are
y = sin(2*pi*50*t)+sin(2*pi*120*t)
m=3
you can see the steps of order reversing used as built-in function but non others. you will also see the taking butterfly tree steps.
for more information read the help file of function.
in future this can be improve as selective radix or any other feature you suggest please notice me for any sugestion.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
压缩包 : 21840307fastfouriertransform.rar 列表 FastFourierTransform.m