The so-called “six-step” algorithm for this operation uses transpositions at steps one and four to improve locality of reference. An out-of-place algorithm for computing this operation on vector processors does not require bit reversal, but the vectors change in length during the computation. Shmuel Winograd used the Chinese remainder theorem for polynomials to develop an algorithm for this operation that limited the number of floating-point multiplications. Plans to monitor Soviet nuclear tests motivated the development of the common radix-2 algorithm for this operation that combines subcomputations using precomputed roots of unity called twiddle factors. A “big O of n log n” algorithm for this operation was designed by James Cooley and John Tukey (“TOO-kee”). For 10 points, digital signal analysis heavily relies on what operation that converts a sequence of time data to a sequence of frequency data? ■END■
ANSWER: fast Fourier transform [or FFT or IFFT or inverse fast Fourier transform; accept DFT, discrete Fourier transform, IDFT, or inverse discrete Fourier transform; prompt on Fourier transform or Fourier decomposition; reject “transform”] (The second sentence refers to the Stockham FFT, which is called self- or auto-sorting.)
<Other Science>
= Average correct buzz position