Parallelism in the computation of the FFT and the WFTA

Arithmetic concurrencies, such as those found in special-purpose fast Fourier transform (FFT) hard-ware, are surveyed and categorized. Similar structures are then derived for the Winograd Fourier transform algorithm (WFTA). Relative time-efficiency plots are obtained for the 1024-point radix-4 FFT and the 1008-point WFTA as a function of the number of real arithmetic operations executable in parallel. This comparison shows that the relative time efficiency of the two algorithms in sequential computations generally carries over to cases where arithmetic parallelism is exploited.