And these numbers are nonpower- of-two. Typically, the fast Fourier transform (FFT) is based on a power-of-two algorithm. We do have some algorithms to compute the non-power-of-two FFT such as the ...

School of Chemistry, University of Edinburgh, Edinburgh, EH9 3JJ, U.K. and Sasol Technology U.K., Purdie Building, North Haugh, St. Andrews, KY16 9SR, U.K. Article Views are the COUNTER-compliant sum ...