Location:
Search - tukey
Search list
Description: 利用经典的Cooley-Tukey基2算法求复序列 的DFT
Platform: |
Size: 2261 |
Author: 张华 |
Hits:
Description: 可利用该源码程序用Blackman-Tukey法（自相关法）对信号 作功率谱估计。
Platform: |
Size: 949 |
Author: wangzugao |
Hits:
Description: 利用经典的Cooley-Tukey基2算法求复序列x（n）的DFT X（k）
Platform: |
Size: 1145 |
Author: enhom |
Hits:
Description: 离散傅里叶变换是20世纪60年代是计算复杂性研究的主要里程碑之一，1965年Cooley和Tukey所研究的计算离散傅里叶变换(Discrete Fourier Test)的快速傅氏变换(FFT)将计算量从О(n2)下降至О(nlogn)，推进了FFT更深层、更广法的研究与应用。
这是一个傅氏变换的MPI程序，用C语言实现。
Platform: |
Size: 4134 |
Author: chj |
Hits:
Description: 利用经典的Cooley-Tukey基2算法求复序列 的DFT
Platform: |
Size: 2048 |
Author: 张华 |
Hits:
Description: 可利用该源码程序用Blackman-Tukey法（自相关法）对信号 作功率谱估计。-Can make use of the source program using Blackman-Tukey method (autocorrelation method) on the signal for the power spectrum estimation.
Platform: |
Size: 1024 |
Author: wangzugao |
Hits:
Description: 利用经典的Cooley-Tukey基2算法求复序列x（n）的DFT X（k）-Use of the classic Cooley-Tukey radix-2 algorithm for complex sequence x (n) of the DFT X (k)
Platform: |
Size: 1024 |
Author: enhom |
Hits:
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: 利用经典的Cooley-Tukey基2算法求复序列的DFT-Use of the classic Cooley-Tukey radix-2 algorithm for complex sequence of DFT
Platform: |
Size: 1024 |
Author: dayuruozhi |
Hits:
Description: 用Blackman-Tukey方法（自相关法）实现对任意输入的实序列函数x(n)作功率谱估计。-Using Blackman-Tukey method (autocorrelation method) to achieve the actual sequence of arbitrary input function x (n) for power spectrum estimation.
Platform: |
Size: 2048 |
Author: gjj |
Hits:
Description: 利用经典的COOLEY-TUKEY基2算法求复序列x[n]的DFTX[k].有Fortran的子程序和主程序,还有C程序-The use of classic COOLEY-TUKEY radix-2 algorithm for complex sequence x [n] of DFTX [k]. Have the Fortran subroutines and main program, there are C procedures
Platform: |
Size: 2048 |
Author: 刘建 |
Hits:
Description: This article describes a new efficient implementation of the Cooley-Tukey fast Fourier transform (FFT) algorithm using C++ template metaprogramming. Thank to the recursive nature of the FFT, the source code is more readable and faster than the classical implementation. The efficiency is proved by performance benchmarks on different platforms.
Platform: |
Size: 52224 |
Author: nytza |
Hits:
Description: cmpfft.for（hcmpfft.for）
利用经典的Cooley-Tukey基2算法求复序列 的DFT
-cmpfft.for (hcmpfft.for) to use the classic Cooley-Tukey radix-2 algorithm for the DFT complex sequence
Platform: |
Size: 1024 |
Author: 金茜 |
Hits:
Description: 利用tukey和barlett方法对随机信号的功率谱进行估计。迭代方法来判断性能-Tukey and the use of random signal barlett method to estimate the power spectrum. Iterative method to determine the performance of
Platform: |
Size: 1024 |
Author: 罗西基 |
Hits:
Description: 经典法，布莱克曼-图基法求谱估计，简单实用-Classical method, Blackman- map-based spectrum estimation method, simple and practical
Platform: |
Size: 1024 |
Author: 赵小飞 |
Hits:
Description: The function implement the 1D sequency(Walsh) ordered fast Walsh-Hadamard transform which can be used in signal processing, pattern recongnition and Genetic alogorithms.
This algorithm uses a Cooley-Tukey type signal flow graph and is implemented in N log2 N additions and subtractions. Data sequence length must be an integer power of 2.
The inverse transform is the same as the forward transform except for the multiplication factor N. This can be easily achieved by deleting the last line i.e. x=inv(N)*x
Example:
x=[1 2 1 1]
W=FWHT(x) -The function implement the 1D sequency(Walsh) ordered fast Walsh-Hadamard transform which can be used in signal processing, pattern recongnition and Genetic alogorithms.
This algorithm uses a Cooley-Tukey type signal flow graph and is implemented in N log2 N additions and subtractions. Data sequence length must be an integer power of 2.
The inverse transform is the same as the forward transform except for the multiplication factor N. This can be easily achieved by deleting the last line i.e. x=inv(N)*x
Example:
x=[1 2 1 1]
W=FWHT(x)
Platform: |
Size: 2048 |
Author: ry |
Hits:
Description: 自相关法求全极点模型参数；
下行递归；
逆Levinson-Durbin递归（模型参数~自相关序列）；
平均周期图的Bartlett方法；
Blackman-Tukey功率谱估计。-Autocorrelation perfection pole model parameters downward recursion inverse Levinson-Durbin recursion (model parameters ~ autocorrelation sequence) the average of the Bartlett periodogram method Blackman-Tukey power spectrum estimation.
Platform: |
Size: 2048 |
Author: jin |
Hits:
Description: twiddle factor - a part of cooley-tukey algorithm
Platform: |
Size: 1024 |
Author: shimis |
Hits:
Description: 图像处理中对图像加上tukey窗后的效果-add tukey window to image
Platform: |
Size: 50176 |
Author: John |
Hits:
Description: cooley tukey algorithm for FFT calculation
Platform: |
Size: 118784 |
Author: amir |
Hits: