- Category:
- MPI
- Tags:
-
- File Size:
- 210kb
- Update:
- 2017-07-17
- Downloads:
- 0 Times
- Uploaded by:
- guowei
Description: FFT, that is fast Fourier transform, is a fast algorithm for discrete Fourier transform. It is based on the odd, even, imaginary, real and other characteristics of discrete Fourier transform, and the algorithm of discrete Fu Liye transform is improved. It does not make new discoveries about the theory of Fourier transform, but it can be a big step for the application of discrete Fu Liye transform in computer system or digital system.
Let x (n) is a complex sequence of N, by DFT transform, either X (m) calculations are N times N-1 times complex multiplication and addition, and a complex multiplication is equivalent to four times the number of multiplication and two real addition, a complex addition is equivalent to two times the number of addition,
To Search:
File list (Check if you may need any files):
并行计算MPI程序设计.docx
Download