Banyan models for the parallel implementation of the fast Fourier transform algorithm

AbstractWe give banyan models for the fast Fourier transform (FFT) algorithms for calculating the discrete Fourier transforms (DFT) of: (1) 2k-point data; (2) -point; (3) two-dimensional (n × n)-arrays of data and (4) μ-dimensional nμ-arrays of data. We discuss the parallel implementation of each of these FFT algorithms