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,

并行计算MPI程序设计.docx

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．