Skip to content

cooley-tukey 2-radix discrete fast fourier transform in C for embedded systems

License

Notifications You must be signed in to change notification settings

brendanashworth/fft-small

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Fast Fourier Transform

This is an implementation of the Cooley-Tukey FFT algorithm designed for embedded systems. It uses the 2-radix variation to grow with O(n log n) complexity.

This implementation, unlike most found elsewhere, does not dynamically allocate memory on the heap and thus is easier to use in embedded systems. It also has a deterministic runtime given any size sample.

Usage

/* Fast Fourier Transform
 * Cooley-Tukey algorithm with 2-radix DFT
 */

void fft_slow(int* x, double complex* X, uint16_t N);

void fft(int* x, double complex* X, uint16_t N);

License

MIT

About

cooley-tukey 2-radix discrete fast fourier transform in C for embedded systems

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published