 Some FFTs other than Cooley–Tukey, such as the Rader–Brenner algorithm, are intrinsically less stable.In fixed-point arithmetic, the finite-precision errors accumulated by FFT algorithms are worse, with rms errors growing as O() for the Cooley–Tukey algorithm (Welch, 1969).Moreover, even achieving this accuracy requires careful attention to scaling to minimize loss of precision, and fixed-point FFT algorithms involve rescaling at each intermediate stage of decompositions like Cooley–Tukey.