搜索结果

Discrete Fourier Transform and Power Spectrum Calculates Power Spectrum from a Time Series

FFTW, a collection of fast C routines to compute the Discrete Fourier Transform in one or more dimensions.The fftw/ directory contains the source code for the complex transforms, and the rfftw/ directory contains the source code for the real transforms.

A implementation of the discrete Fourier transform in visual basic classic.

Computing-the-2-D Discrete-Fourier-Transform IEEE article

A 64 points Discrete Fourier Transform code in AVR asm.

Getting to Know the FFT What is the FFT? FFT = Fast Fourier Transform. The FFT is a faster version of the Discrete Fourier Transform (DFT). The FFT utilizes some clever algorithms to do the same thing as the DTF, but in much less time.

This is a package to calculate Discrete Fourier/Cosine/Sine Transforms of 1-dimensional sequences of length 2^N. This package contains C and Fortran FFT codes.

fourier transform and MATLAB

8点基二fft Fast Fourier Transform (FFT). Using 8 points, takes about 1.2 ms to execute one FFT. Sets up General Purpose Timer 1 to generate events at 10 kHz. Will produce 10 kHz output on T1PWM and T1PWM pins.

Fast Discrete Curvelet Transform有正反变换,各个程序里面的参数都有详细的说明.