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:
Description: fft并行算法实现，C语言开发，用mpi编程完成-fft parallel algorithm, C language development, with the completion of mpi programming Platform: |
Size: 2048 |
Author:kmart |
Hits:
Description: ，主要包括并行程
序设计基础（并行计算机系统与结构模型、ＰＣ机群搭建和并行程序设计简介等）、并行程序
编程指南（ＭＰＩ、ＰＶＭ、ＨＰＦ和ＯｐｅｎＭＰ等）和并行程序开发方法（可视化并行程序设计环境、
并行程序调试和并行程序性能分析及优化等）；下篇为并行算法编程实现，主要包括非数值
并行算法（排序、串匹配、图论、组合优化和计算几何等）及其ＭＰＩ编程实现和数值计算并行
算法（矩阵运算、线性方程组求解、矩阵特征值计算和傅氏及小波变换等）及其ＭＰＩ编程实
现。-, Main parallel programming foundation (parallel computer system with the structural model, PC cluster structures and parallel programming brief), Parallel Programming Guide (MPI, PVM, HPF and OpenMP, etc.) and the parallel program development approach (visual parallel programming environment, debugging of parallel programs and parallel program performance analysis and optimization, etc.) next parallel algorithm programming, including the non-numerical parallel algorithms (sorting, string matching, graph theory, combinatorial optimization, and computational geometry, etc.) and its MPI programming parallel algorithms and numerical calculation (matrix operations, solving linear equations, matrix eigenvalue calculation and Fourier and wavelet transform, etc.) and its MPI programming. Platform: |
Size: 2525184 |
Author:陈晓东 |
Hits:
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:
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:
Description: 快速傅里叶变换的MPI并行程序，基于vc编写，可以用于大型快速计算-Fast Fourier Transform MPI parallel program, based on vc preparation, can be used to quickly calculate large Platform: |
Size: 4096 |
Author:john |
Hits:
Description: CurveLab is a collection of Matlab and C++ programs to compute fast
discrete curvelet transform in two and three dimensions.
The 2d software includes the implementations of two algorithms: the
transform using wrapping and the one using unequally-spaced fast
fourier transform (USFFT).
The 3d software includes the in-core, out-core and MPI-based parallel
implementation of the 3d algorithm.
To install the package, see curvelab.pdf.
Contacts:
curvelab@curvelet.org
www.curvelet.org
Platform: |
Size: 81920 |
Author:henry |
Hits:
Description: 《MPI与OpenMP并行程序设计(C语言版)》是美国Oregon州立大学的Michael J.Quinn教授在多年讲授“并行程序设计”课程的基础上编写而成的，主要介绍用C语言，并结合使用MPI和OpenMP进行并行程序设计，内容包括并行体系结构、并行算法设计、消息传递编程、Eratosthenes 筛法、Floyd 算法、性能分析、矩阵向量乘法、文档分类、蒙特卡洛法、矩阵乘法、线性方程组求解、有限差分方法、排序、快速傅立叶变换、组合搜索、共享存储编程、融合OpenMP和MPI以及5个附录。-" MPI and OpenMP parallel programming (C language version)" is Michael J.Quinn Professor Oregon State University in the years written in a lecture on " parallel programming" course, based on the C language introduces, and in conjunction with MPI and OpenMP parallel programming, including parallel architectures, parallel algorithm design, message passing programming, Eratosthenes sieve method, Floyd algorithm, performance analysis, matrix-vector multiplication, document classification, Monte Carlo method, matrix multiplication, linear equations solving finite difference method, sorting, fast Fourier transform, a combination of search, shared memory programming, integration OpenMP and MPI and five appendices. Platform: |
Size: 48901120 |
Author:艾艾 |
Hits:
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:
Search - fourier transform transform mpi