Winograd extended Rader's algorithm to include prime-power DFT sizes formula_1, and today Rader's algorithm is sometimes described as a special case of Winograd's FFT algorithm, also called the "multiplicative Fourier transform algorithm" (Tolimieri et al., 1997), which applies to an even larger class of sizes. However, for composite sizes such as prime powers, the Cooley–Tukey FFT algorithm is much simpler and more practical to implement, so Rader's algorithm is typically only used for large-prime base cases of Cooley–Tukey's recursive decomposition of the DFT.