Definitions from Wikipedia (Prime-factor FFT algorithm)

▸ noun:  The prime-factor algorithm, also called the Good–Thomas algorithm, is a fast Fourier transform algorithm that re-expresses the discrete Fourier transform of a size N = N1N2 as a two-dimensional N1×N2 DFT, but only for the case where N1 and N2 are relatively prime.


▸ Words similar to Prime-factor FFT algorithm
▸ Usage examples for Prime-factor FFT algorithm

▸ Idioms related to Prime-factor FFT algorithm
▸ Wikipedia articles (New!)
▸ Words that often appear near Prime-factor FFT algorithm
▸ Rhymes of Prime-factor FFT algorithm

▸ Invented words related to Prime-factor FFT algorithm