{"version":"1.0","type":"link","title":"Prime-factor FFT algorithm - Newikis","description":"The prime-factor algorithm (PFA), also called the Good–Thomas algorithm (1958/1963), is a fast Fourier transform (FFT) algorithm that re-expresses the discrete Fourier transform (DFT) of a size N = N1N2 as a two-dimensional N1 × N2 DFT, but only for the case where N1 and N2 are relatively prime.…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}