Skip to content

Compute the fourier transform of a signal using cuFFT or FFTW with the interface UNIX-like utility.

License

Notifications You must be signed in to change notification settings

wangwt9907/ConvenientSignalFFT

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Raul P. Pelaez 2017. Fast Fourier Transform

Takes a single column signal and outputs its FFT (using cuda) in frequency domain.

Needs CUDA>7.5 to work, check src/Makefile, if you have boost you can say so there and gain some speed.

Currently only GPU implementation is provided

Usage:

fft -N [N] -Fs [Fs] -prec [double/float] < signal

N: Number of points in the signal
Fs: Sampling frequency
prec: Precision mode, float by default

Example:

seq 0 0.2 10000 |  awk '{print sin($1)}' | fft -N 10000 -Fs 5.0 > kk

w=$(grep $( datamash -W max 2 <kk) kk | awk '{print 2*3.1415*$1}')

w will be 1

About

Compute the fourier transform of a signal using cuFFT or FFTW with the interface UNIX-like utility.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • C++ 77.5%
  • Cuda 21.6%
  • Makefile 0.9%