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
▸ 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