
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
G. Miel, "Constant Geometry Fast Fourier Transforms on Array Processors," IEEE Transactions on Computers, vol. 42, no. 3, pp. 371375, March, 1993.  
BibTex  x  
@article{ 10.1109/12.210180, author = {G. Miel}, title = {Constant Geometry Fast Fourier Transforms on Array Processors}, journal ={IEEE Transactions on Computers}, volume = {42}, number = {3}, issn = {00189340}, year = {1993}, pages = {371375}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.210180}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Constant Geometry Fast Fourier Transforms on Array Processors IS  3 SN  00189340 SP371 EP375 EPD  371375 A1  G. Miel, PY  1993 KW  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. VL  42 JA  IEEE Transactions on Computers ER   
Matrix algebra is used to design and validate parallel algorithms for large constantgeometry fast Fourier transforms (FFTs) on fixedsize array processors. The Npoint 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 shuffleexchange network.
[1] K. E. Batcher, "Sorting networks and their applications," in1968 Spring Joint Comput, Conf., AFIPS Proc., vol. 32, Thompson Books, Washington, DC, 1968, pp. 307314.
[2] T. Feng, "A survey of interconnection networks,"IEEE Comput. Mag., pp. 1227, Dec. 1981.
[3] S. W. Golomb, "Permutations by cutting and shuffling,"SIAM Rev., vol. 3, pp. 293297, 1961.
[4] D. Kleitman, F. T. Leighton, M. Lepley, and G. L. Miller, "New layouts for the shuffle exchange graph," inProc. ACM Symp. Theory Computing, 1981, pp. 278292.
[5] F. Leighton and G. Miller, "Optimal layouts for small shuffleexchange graphs,"J. VLSI, pp. 289299, 1981.
[6] G. Miel, "Constant geometry fast Fourier transforms on array processors," Hughes Research Laboratories Rep., Aug. 6, 1990.
[7] G. Miel, "Trends in systolic and cellular computation,"J. Comput. Appl. Math., vol. 38, pp. 125, 1991.
[8] A. Norton and A. J. Silberger, "Parallelization and performance analysis of the Cooley  Tukey FFT algorithm for sharedmemory architectures,"IEEE Trans. Comput., vol. C36, no. 5, pp. 581591, May 1987.
[9] M. C. Pease, "An adaptation of the fast Fourier transform for parallel processing,"J. ACM, vol. 15, pp. 252264, 1968.
[10] M. C. Pease, "The indirect binary ncube microprocessor array,"IEEE Trans. Comput., vol. C26, no. 5, pp. 548573, May 1977.
[11] F. P. Preparata and J. Vuillemin, "The cubeconnected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300309, May 1981.
[12] H. J. Siegel, "The theory underlying the partitioning of permutation networks,"IEEE Trans. Comput., vol. C29, no. 9, pp. 791801, Sept. 1980.
[13] R. C. Singleton, "On computing the fast Fourier transform,"Commun. ACM, vol. 10, pp. 647654, 1967.
[14] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C20, pp. 153161, Feb. 1971.
[15] Stone, H. S. 1987.HighPerformance Computer Architecture. Reading, Mass., AddisonWesley.
[16] C. D. Thompson, "Fourier transforms in VLSI,"IEEE Trans. Comput., vol. C32, no. 11, pp. 10471057, Nov. 1983.
[17] J. Vuillemin, "A combinatorial limit to the computing power of VLSI circuits," inProc. 21st Symp. Foundations Comput. Sci., IEEE Comput. Soc., Oct. 1980, pp. 94300.
[18] J. E. Whelchel, J. P. O'Malley, W. J. Rinard, and J. F. McArthur, "The systolic phase rotation FFTA new algorithm and parallel processor architecture," inProc. 1990 Int. Conf. Acoust., Speech, Signal Processing, IEEE Signal Processing Society, vol. 2, 1990, pp. 10211024.
[19] C. Wu and T. Feng, "Universality of the shuffleexchange network,"IEEE Trans. Comput., vol. C30, no. 5, pp. 324331, May 1981.