This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Parallel Algorithm for 2-D DFT Computation with No Interprocessor Communication
July 1990 (vol. 1 no. 3)
pp. 377-382

A parallel algorithm is proposed for the two-dimensional discrete Fourier transform (2-D 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 2-D 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 N-point 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. 65-71.
[3] J. W. Cooley and J. W. Tukey, "An algorithm for the machine calculation of complex Fourier series,"Math. Computat., vol. 19, pp. 297-301, Apr. 1965.
[4] T. Feng, "Data manipulating functions in parallel processors and their implementations,"IEEE Trans. Comput., vol. C-23, pp. 309-318, Mar. 1974.
[5] I. Gertner and M. Shamash, "VLSI architectures for multidimensional Fourier transform processing,"IEEE Trans. Comput., vol. C-36, pp. 1265-1274, Nov. 1987.
[6] I. Gertner, "A new efficient algorithm to compute the two-dimensional discrete Fourier transform,"IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-36, no. 7, pp. 1036-1050, 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 Urbana-Champaign, 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. 48-71.
[10] C. R. Jesshope, "The implementation of fast radix 2 transforms on array processors,"IEEE Trans. Comput., vol. C-29, no. 1, pp. 20-27, Jan. 1980.
[11] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C-24, pp. 1145-1155, Dec. 1975.
[12] V. Milutinovic, A. B. Fortes, and L. H. Jamieson, "A multiprocessor architecture for real-time computation of a class of DFT algorithms,"IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 1301-1309, Oct. 1986.
[13] A. Norton and A. J. Silberger, "Parallelization and performance analysis of the Cooley -- Tukey FFT algorithm for shared-memory architectures,"IEEE Trans. Comput., vol. C-36, no. 5, pp. 581-591, May 1987.
[14] H. J. Siegel, "Analysis techniques for SIMD machine interconnection networks and the effects of processor address masks,"IEEE Trans. Comput., vol. C-26, pp. 153-161, Feb. 1977.
[15] H. J. Siegel and R. J. McMillen, "The multistage cube: A versatile interconnection network,"IEEE Comput. Mag., vol. 14, pp. 65-76, Dec. 1981.
[16] H. J. Siegel and R. J. McMillen, "Using the augmented data manipulator network in PASM,"IEEE Comput. Mag., vol. 14, pp. 25-33, Feb. 1981.

Index Terms:
Index Termsparallel algorithm; 2-D DFT computation; broadcast; report capabilities; speed performance; parallelism; binary tree computer; fast Fourier transforms; parallel algorithms
Citation:
I. Gertner, M. Rofheart, "A Parallel Algorithm for 2-D DFT Computation with No Interprocessor Communication," IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 3, pp. 377-382, July 1990, doi:10.1109/71.80164
Usage of this product signifies your acceptance of the Terms of Use.