搜索资源列表
tftb-0
- 短时傅立叶变化代码,短时傅立叶变换在信号处理中运用十分广泛。大家都会遇到这个问题。-The application of short-time Fourier transform in signal processing,Everyone will encounter this problem.
rfft
- Real sequence of Fourier transform 实序列傅立叶变换 已验证 用N点FFT计算2N点实序列的FFT，比直接进行2N点FFT运算减少一半运算量 -Real sequence of Fourier transform verified with N points FFT calculation sequence of 2 N point FFT, than half 2 N point FFT operation to reduce computational
GS-Algorithm
- 实现了图片及目标图片的傅立叶变换，并得出了加载到空间光调制器上的相息图！-To achieve the target image and the image of the Fourier transform, and load to obtain a kinoform spatial light modulator on!
stfth
- 用于计算声音信号的短时傅立叶变换，默认情况下窗口重叠了50％，计算STFT三个窗口中的矩形并转化为声音信号。-To compute STFT three windows are available in this code Rectangular, Hamming and Hanning. By default window overlapping is set by 50 . One can easily compute the STFT of sound signals.Results ar
Drawing-of-some-special-graphs
- 变换的傅立叶函数曲线、劳伦兹非线形方程的无序活动、填充图、条形图和阶梯形图-Transformation of the Fu Liye function curve, Lorenz non linear equation of the disorderly activities, filling, bar chart and ladder diagram
FFT_IFFT
- 实现DSP傅里叶变换以及傅立叶反变换的源程序，C语言实现。-Implement DSP Fourier transform, and inverse Fourier transform of the source, C language.
MPI-and-OpenMP-parallel-programming
- 《MPI与OpenMP并行程序设计(C语言版)》是美国Oregon州立大学的Michael J.Quinn教授在多年讲授“并行程序设计”课程的基础上编写而成的，主要介绍用C语言，并结合使用MPI和OpenMP进行并行程序设计，内容包括并行体系结构、并行算法设计、消息传递编程、Eratosthenes 筛法、Floyd 算法、性能分析、矩阵向量乘法、文档分类、蒙特卡洛法、矩阵乘法、线性方程组求解、有限差分方法、排序、快速傅立叶变换、组合搜索、共享存储编程、融合OpenMP和MPI以及5个附录。-&
STC_FFT
- 快速傅里叶变换法（FFT）是离散傅立叶变换的一种快速计算方法，它能使N点DFT的乘法计算量由N2 次降为 次。下图是采样点数为8点FFT时间抽取算法信号流图，本程序也是以这种形式设计的。-Fast Fourier Transform (FFT) is a fast computational method for discrete Fourier transforms that can reduce the multiplication of N-point DFT by N2 times. T
tsansform
- 傅立叶变换用于电力系统谐波分析,全是用c++编的很有价值-Fourier transform is used for power system harmonic analysis, all in c++ compiled are valuable
并行计算MPI程序设计
- FFT，即为快速傅氏变换，是离散傅氏变换的快速算法，它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。它对傅氏变换的理论并没有新的发现，但是对于在计算机系统或者说数字系统中应用离散傅立叶变换，可以说是进了一大步。(FFT, that is fast Fourier transform, is a fast algorithm for discrete Fourier transform. It is based on the odd, even, imaginar