Category:Cooley-Tukey FFT algorithm

From LiteratePrograms

Jump to: navigation, search

The Cooley-Tukey FFT algorithm is a popular fast Fourier transform algorithm for rapidly computing the discrete fourier transform of a sampled digital signal. It applies best to signal vectors whose lengths are highly composite, usually a power of 2.


Articles in category "Cooley-Tukey FFT algorithm"

There is 1 article in this category.

C

Retrieved from "http://en.literateprograms.org/Category:Cooley-Tukey_FFT_algorithm"
Personal tools