
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
I. Gertner, M. Rofheart, "A Parallel Algorithm for 2D DFT Computation with No Interprocessor Communication," IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 3, pp. 377382, July, 1990.  
BibTex  x  
@article{ 10.1109/71.80164, author = {I. Gertner and M. Rofheart}, title = {A Parallel Algorithm for 2D DFT Computation with No Interprocessor Communication}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {1}, number = {3}, issn = {10459219}, year = {1990}, pages = {377382}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.80164}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  A Parallel Algorithm for 2D DFT Computation with No Interprocessor Communication IS  3 SN  10459219 SP377 EP382 EPD  377382 A1  I. Gertner, A1  M. Rofheart, PY  1990 KW  Index Termsparallel algorithm; 2D DFT computation; broadcast; report capabilities; speed performance; parallelism; binary tree computer; fast Fourier transforms; parallel algorithms VL  1 JA  IEEE Transactions on Parallel and Distributed Systems ER   
A parallel algorithm is proposed for the twodimensional discrete Fourier transform (2D DFT) computation which eliminates interprocessor communications and uses only O(N) processors. The mapping of the algorithm onto architectures with broadcast and report capabilities is discussed. Expressions are obtained for estimating the speed performance on these machines as a function of the size N*N of the 2D DFT, the bandwidth of the communications channel, the time for an addition, the time T(F/sub N/) for a singleprocessing element to perform an Npoint DFT, and the degree of parallelism. For single I/O channel machines that are capable of exploiting the full degree of parallelism of the algorithm, attainable execution times are as low as the time T(F/sub N/) plus the I/O time for data upload and download. An implementation on a binary tree computer is discussed.
[1] AT&T WE DSP32 and DSP32C Reference Manual, AT&T.
[2] K. E. Batcher, "The flip network in Staran," inProc. Int. Conf. Parallel Processing, Aug. 1976, pp. 6571.
[3] J. W. Cooley and J. W. Tukey, "An algorithm for the machine calculation of complex Fourier series,"Math. Computat., vol. 19, pp. 297301, Apr. 1965.
[4] T. Feng, "Data manipulating functions in parallel processors and their implementations,"IEEE Trans. Comput., vol. C23, pp. 309318, Mar. 1974.
[5] I. Gertner and M. Shamash, "VLSI architectures for multidimensional Fourier transform processing,"IEEE Trans. Comput., vol. C36, pp. 12651274, Nov. 1987.
[6] I. Gertner, "A new efficient algorithm to compute the twodimensional discrete Fourier transform,"IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP36, no. 7, pp. 10361050, July 1988.
[7] A. L. Gorin, L. Auslander, and A. Silberger, "Balanced computation of 2D transforms on a tree machine,"Appl. Math. Lett., to be published.
[8] W. S. Hornick, "The mesh of trees architecture for parallel computation," Ph.D. dissertation, Univ. of Illinois at UrbanaChampaign, Jan. 1989.
[9] L.H. Jamieson, P. Mueller, and H.J. Siegel, "FFT Algorithms for SIMD Parallel Processing Systems,"J. Parallel and Distributed Computation, Vol. 3, No. 1, Mar. 1986, pp. 4871.
[10] C. R. Jesshope, "The implementation of fast radix 2 transforms on array processors,"IEEE Trans. Comput., vol. C29, no. 1, pp. 2027, Jan. 1980.
[11] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C24, pp. 11451155, Dec. 1975.
[12] V. Milutinovic, A. B. Fortes, and L. H. Jamieson, "A multiprocessor architecture for realtime computation of a class of DFT algorithms,"IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP34, pp. 13011309, Oct. 1986.
[13] 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.
[14] H. J. Siegel, "Analysis techniques for SIMD machine interconnection networks and the effects of processor address masks,"IEEE Trans. Comput., vol. C26, pp. 153161, Feb. 1977.
[15] H. J. Siegel and R. J. McMillen, "The multistage cube: A versatile interconnection network,"IEEE Comput. Mag., vol. 14, pp. 6576, Dec. 1981.
[16] H. J. Siegel and R. J. McMillen, "Using the augmented data manipulator network in PASM,"IEEE Comput. Mag., vol. 14, pp. 2533, Feb. 1981.