Welcome![Sign In][Sign Up]
Location:
Search - FFT MPI

Search list

[Other resourcempifft

Description: 利用Mpi编写的FFT的并行实现,很不错的阿-prepared by the use of prostitutes parallel FFT, very good A
Platform: | Size: 3689 | Author: sun ligang | Hits:

[Mathimatics-Numerical algorithmsfft

Description: 离散傅里叶变换是20世纪60年代是计算复杂性研究的主要里程碑之一,1965年Cooley和Tukey所研究的计算离散傅里叶变换(Discrete Fourier Test)的快速傅氏变换(FFT)将计算量从О(n2)下降至О(nlogn),推进了FFT更深层、更广法的研究与应用。 这是一个傅氏变换的MPI程序,用C语言实现。
Platform: | Size: 4134 | Author: chj | Hits:

[Other resourceFft

Description: fft并行算法实现,C语言开发,用mpi编程完成
Platform: | Size: 2516 | Author: kmart | Hits:

[MPImpifft

Description: 利用Mpi编写的FFT的并行实现,很不错的阿-prepared by the use of prostitutes parallel FFT, very good A
Platform: | Size: 3072 | Author: sun ligang | Hits:

[MPIPoisson_MPI.f90

Description: 用MPI在fortran下 泊松方程的并行实现-with MPI in fortran under Poisson equation parallel
Platform: | Size: 8192 | Author: 段宾 | Hits:

[Mathimatics-Numerical algorithmsfft

Description: 离散傅里叶变换是20世纪60年代是计算复杂性研究的主要里程碑之一,1965年Cooley和Tukey所研究的计算离散傅里叶变换(Discrete Fourier Test)的快速傅氏变换(FFT)将计算量从О(n2)下降至О(nlogn),推进了FFT更深层、更广法的研究与应用。 这是一个傅氏变换的MPI程序,用C语言实现。-Discrete Fourier Transform of the 20th century 60 s computational complexity is a major milestone in one study, in 1965 Cooley and Tukey studied the calculation of discrete Fourier transform (Discrete Fourier Test) fast Fourier transform (FFT) calculation increased from О (n2) dropped to О (nlogn), the FFT to promote deeper, broader research and application of law. This is a Fourier transform of the MPI process, with C language.
Platform: | Size: 4096 | Author: chj | Hits:

[MPIFft

Description: fft并行算法实现,C语言开发,用mpi编程完成-fft parallel algorithm, C language development, with the completion of mpi programming
Platform: | Size: 2048 | Author: kmart | Hits:

[AlgorithmFFT.c

Description: Fast Fourier Transform using MPI libraries (Source Code)
Platform: | Size: 3072 | Author: Chitra | Hits:

[MPIFFT

Description: 一个不错的快速傅里叶变换并行算法的MPI源程序-A MPI source code for fast Fourier transform s parallel algorithm
Platform: | Size: 4096 | Author: Juri hui | Hits:

[MPImpi-code

Description: 并行程序设计源码(转载)包过 FFT Sort -parallel code including FFT Sort and so on
Platform: | Size: 838656 | Author: yueming | Hits:

[Windows Developparallel-fft

Description: 傅里叶变换的并行源代码,mpi+vc6.0,带数据-parallel compute of fft
Platform: | Size: 3072 | Author: 程宾 | Hits:

[MPI3dfft_files

Description: 3 Dimensional FFT using MPI and OpenMP
Platform: | Size: 6144 | Author: Divya | Hits:

[MPIfft

Description: 使用MPI并行设计计算快速傅里叶变换,包含测试数据-MPI fft transform
Platform: | Size: 10240 | Author: tony | Hits:

[MPIfft

Description: fft(快速傅里叶变换)的并行算法实现,算法是在MPI的并行环境下执行-The Parallel Algorithm of FFT
Platform: | Size: 3072 | Author: 黄明 | Hits:

[MPI22-1

Description: FFT的MPI并行实现,很不错的哦。在vs2005中编译通过-The MPI parallel implementation of FFT
Platform: | Size: 4096 | Author: 芦奉良 | Hits:

[MPIfft

Description: 基于C语言的快速傅里叶变换FFT消息传递MPI编程,可以在并行计算机中编译与运行-Fast Fourier Transform (FFT) based on the C language MPI message passing programming parallel computers can be compiled and run
Platform: | Size: 1024 | Author: 陈立 | Hits:

[MPIFFT

Description: 一种基于mpi的FFT(快速傅里叶变换)实现 数字信号处理 DSP 离散信号分析-FFT (Fast Fourier Transform) based on a mpi DSP digital signal processing discrete signal analysis
Platform: | Size: 15360 | Author: ren | Hits:

[MPImpi

Description: 并行算法实践 高教出版社陈国良编 书中所附38个MPI并行源程序代码,包括从排序到FFT的很多经典算法- Practice of Parallel Algorithm Chen Guoliang edited Higher Education Press, the book accompanying 38 MPI parallel source code, including many the ordering to the FFT algorithm classic
Platform: | Size: 879616 | Author: | Hits:

[MPI并行计算MPI程序设计

Description: FFT,即为快速傅氏变换,是离散傅氏变换的快速算法,它是根据离散傅氏变换的奇、偶、虚、实等特性,对离散傅立叶变换的算法进行改进获得的。它对傅氏变换的理论并没有新的发现,但是对于在计算机系统或者说数字系统中应用离散傅立叶变换,可以说是进了一大步。(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,)
Platform: | Size: 215040 | Author: GuoW | Hits:

[MPIfft

Description: 基于MPI的并行快速傅里叶变换算法,通过多核并行计算提升计算性能。(the fast Fourier transform algorithm based on MPI coding)
Platform: | Size: 1024 | Author: pengbd | Hits:
« 12 »

CodeBus www.codebus.net