Search - ffts - CodeBus

[Other resource] spectral

Description: The Spectral Toolkit is a C++ spectral transform library written by Rodney James and Chuck Panaccione while at the National Center for Atmospheric Research between 2002 and 2005. The library contains a functional subset of FFTPACK and SPHEREPACK, including real and complex FFTs in 1-3 dimensions, and a spherical harmonic transform. Multithreading is supported through POSIX threads for the multidimensional transforms. This reference guide provides details of the public interface as well as the internal implementation of the library.
Platform: | Size: 492416 | Author: 薛斌 | Hits:

[Communication-Mobile] fftgibbs

Description: To show Gibbs phenomenon, using FFTs to sum Fourier Give the curve plot at the end of the simulation
Platform: | Size: 948 | Author: 王有 | Hits:

[Communication] fftseq

Description: 基于matlab的各种模拟信号的产生，如阶跃信号，正弦函数，三角函数等-based on the Matlab the analog signal generated, as a step signal sine function, trigonometry, etc.
Platform: | Size: 1024 | Author: 姚连喜 | Hits:

[Algorithm] spectral

Description: The Spectral Toolkit is a C++ spectral transform library written by Rodney James and Chuck Panaccione while at the National Center for Atmospheric Research between 2002 and 2005. The library contains a functional subset of FFTPACK and SPHEREPACK, including real and complex FFTs in 1-3 dimensions, and a spherical harmonic transform. Multithreading is supported through POSIX threads for the multidimensional transforms. This reference guide provides details of the public interface as well as the internal implementation of the library. -The Spectral Toolkit is a C++ Spectral transform library written by Rodney James and Chuck Panaccione while at the National Center for Atmospheric Research between 2002 and 2005. The library contains a functional subset of FFTPACK and SPHEREPACK, including real and complex FFTs in 1-3 dimensions, and a spherical harmonic transform. Multithreading is supported through POSIX threads for the multidimensional transforms. This reference guide provides details of the public interface as well as the internal implementation of the library.
Platform: | Size: 492544 | Author: 薛斌 | Hits:

[Communication-Mobile] fftgibbs

Description: To show Gibbs phenomenon, using FFTs to sum Fourier Give the curve plot at the end of the simulation
Platform: | Size: 1024 | Author: 王有 | Hits:

[Algorithm] FFTS

Description: 快速傅里叶变化！Fortran语言编写！ -Fast Fourier change! Fortran language!
Platform: | Size: 53248 | Author: 刘鹏 | Hits:

[DSP program] DSP_RFFTTEST

Description: DSP算法 Exercise the rfft function for real FFTs-DSP Algorithm Exercise the rfft function for real FFTs
Platform: | Size: 1024 | Author: vts | Hits:

[Algorithm] ffts

Description: 变步长梯形求积法，并以exp(-x*x)为例计算求积分-Variable Step-trapezoidal quadrature method, and exp (-x* x) as an example for calculating the integral
Platform: | Size: 1024 | Author: 953427 | Hits:

[Communication] c_FFT

Description: The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT algorithm (following the ideas in the CMU Task parallel suite). 1.- Generates an input signal vector (dgen) with size n=n1xn2 stored in row major order In this code the size of the input signal is NN=NxN (n=NN, n1=n2=N) 2.- Transpose (tpose) A to have it stored in column major order 3.- Perform independent FFTs on the rows (cffts) 4.- Scale each element of the resulting array by a factor of w[n]**(p*q) 5.- Transpose (tpose) to prepair it for the next step 6.- Perform independent FFTs on the rows (cffts) 7.- Transpose the resulting matrix The code requires nested Parallelism.-The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT algorithm (following the ideas in the CMU Task parallel suite). 1.- Generates an input signal vector (dgen) with size n=n1xn2 stored in row major order In this code the size of the input signal is NN=NxN (n=NN, n1=n2=N) 2.- Transpose (tpose) A to have it stored in column major order 3.- Perform independent FFTs on the rows (cffts) 4.- Scale each element of the resulting array by a factor of w[n]**(p*q) 5.- Transpose (tpose) to prepair it for the next step 6.- Perform independent FFTs on the rows (cffts) 7.- Transpose the resulting matrix The code requires nested Parallelism.
Platform: | Size: 4096 | Author: ramya | Hits:

[Other] FFTsAndIFFTbySystemFunction

Description: 采用OPENCV系统的正逆傅里叶变换的函数实现傅里叶正逆变换，写成了一个类。-adopt system functions to implement the FFTs and IFFTs.
Platform: | Size: 411648 | Author: 薛琴 | Hits:

[Other] HightFilterAndLowFilter

Description: 实现正逆傅里叶变换，并在此基础上实现各种高低通滤波器，采用OPENCV实现。图像只针对2的整数次幂的方图-implement kinds of high filters and low filters in OPENCV based on implementing the FFTs and IFFTS.
Platform: | Size: 201728 | Author: 薛琴 | Hits:

[Other] OPENCVDFT

Description: 采用OPENCV中函数DFT实现正傅里叶变换。-implement the FFTs by using DFT function in OPENCV .
Platform: | Size: 227328 | Author: 薛琴 | Hits: