Location:
Search - FFT2D.for
Search list
Description: 离散傅立叶变换已成为数字信号处理的重要工具，然而，它的计算量较大，运算时间长，在某种程度上却限制了它的使用范围。快速算法大大提高了运算速度，在某些应用场合已能作到实时处理，并且开始应用于控制系统。-Discrete Fourier Transform digital signal processing has become an important tool, however, the calculation of its larger, long computing time, but in a way limits the scope of its use. Fast Algorithm for greatly enhanced speed of operation, in some applications has been able to do real-time processing and control system began to be used.
Platform: |
Size: 2048 |
Author: jiarend |
Hits:
Description: 2维fft程序，包括fortran和c语言-2-D fft procedures, including the fortran and c language
Platform: |
Size: 61440 |
Author: muyou |
Hits:
Description: 2dFFT的奈奎斯特频率为 ，（ 为采样间隔）实际上的FFT变换点数要求为2的n次幂，各点所对应的频率是从 到 ，求出 后，可以用 ，这里N为FFT变换的点数。如变换点数为2048，由于对称性，实际有用的点数为1024个。
在该程序中，做完富氏变换后，已经将数据按照频率从0到 到0的顺序排好。
在运行结果中，只需存储左下角的1/4区域的数据即可。
-2dFFT of the Nyquist frequency, (for the sampling interval) is actually the FFT, the n number of points required for the power of 2, the frequency corresponding to each point is to, find, you can use the FFT, where N points. Such as the transformation point to 2048, due to the symmetry, the actual useful points to 1024. In the process, done after the Fourier transform has the data in accordance with the frequency range from 0 to 0 in order to line up. In the run results, only the lower left corner of the store 1/4 of regional data can be.
Platform: |
Size: 525312 |
Author: |
Hits: