Banyan models for the parallel implementation of the fast Fourier transform algorithm (Q1107307)

This paper describes parallel implementations of the fast Fourier transforms on: (1) \(2^ k\)-point data, (2) n-point data, (3) two- dimensional (n\(\times n)\) arrays of data, and (4) \(\mu\)-dimensional \(n^{\mu}\) arrays of data in both the decimation-in-time version and the decimation-in-frequency version.