Definitions from Wikipedia (Bruun's FFT algorithm)
▸ noun: Bruun's algorithm is a fast Fourier transform algorithm based on an unusual recursive polynomial-factorization approach, proposed for powers of two by G. Bruun in 1978 and generalized to arbitrary even composite sizes by H. Murakami in 1996.
▸ Words similar to bruun's fft algorithm
▸ Usage examples for bruun's fft algorithm
▸ Idioms related to bruun's fft algorithm
▸ Wikipedia articles (New!)
▸ Words that often appear near bruun's fft algorithm
▸ Rhymes of bruun's fft algorithm
▸ Invented words related to bruun's fft algorithm
▸ noun: Bruun's algorithm is a fast Fourier transform algorithm based on an unusual recursive polynomial-factorization approach, proposed for powers of two by G. Bruun in 1978 and generalized to arbitrary even composite sizes by H. Murakami in 1996.
▸ Words similar to bruun's fft algorithm
▸ Usage examples for bruun's fft algorithm
▸ Idioms related to bruun's fft algorithm
▸ Wikipedia articles (New!)
▸ Words that often appear near bruun's fft algorithm
▸ Rhymes of bruun's fft algorithm
▸ Invented words related to bruun's fft algorithm