Issue No.03 - March (1993 vol.42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.210180
<p>Matrix algebra is used to design and validate parallel algorithms for large constant-geometry fast Fourier transforms (FFTs) on fixed-size array processors. The N-point radix 2 case for a linear array processor with N/2 cells is identical to the usual procedure corresponding to the matrix factorization of M.C. Pease, (1968). The algorithms are engendered by matrix factorizations, which themselves depend on a basic factorization of the perfect shuffle. The resulting data movement is realized in parallel as relatively small perfect shuffles inside each local memory and along each row and column of the array processor, without requiring that the complete array itself have the shuffle-exchange network.</p>
constant geometry FFT; fast Fourier transforms; array processors; parallel algorithms; matrix factorization; perfect shuffle; local memory; fast Fourier transforms; logic arrays; matrix algebra; parallel algorithms.
G. Miel, "Constant Geometry Fast Fourier Transforms on Array Processors", IEEE Transactions on Computers, vol.42, no. 3, pp. 371-375, March 1993, doi:10.1109/12.210180