Abstract
New algorithms for the DFT and the 2-dimensional DFT are presented. The DFT and the 2-dimensional DFT matrices can be expressed as the Kronecker product of DFT matrices of smaller dimension. These algorithms are synthesized by combining the efficient factorization of the Kronecker product of matrices with the highly hardware efficient recursive implementation of the smaller DFT matrices, to yield these algorithms. The architectures of the processors implementing these algorithms consist of 2-dimensional grid of processing elements, have temporal and spatial locality of connections. For computing the DFT of sizeN or for the 2D DFT of sizeN=N 1 byN 1, these algorithms require 2N multipliers and adders, take approximately\(2\sqrt N \) computational steps for computing a transform vector, and take approximately\(\sqrt N \) computation steps between the computation of two successive transform vectors.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A.V. Oppenheim and R.W. Schafer,Digital Signal Processing, Englewood Cliffs, NJ: Prentice-Hall, 1975.
E.O. Brigham,The Fast Fourier Transform, Englewood Cliffs, NJ: Prentice-Hall, 1974.
D.F. Elliott and K.R. Rao,Fast Transforms, New York: Academic Press, 1982.
I.J. Good, “The interactive algorithm and the practical Fourier analysis,”J. Roy. Statist. Soc. Ser. B, vol. 20, 1958, pp. 34–35.
J.W. Cooley and J.W. Tukey, “An algorithm for the machine calculation of complex Fourier serier,”Math. Computation, vol. 19, 1965, pp. 297–301.
S. Winograd, “A new method for computing DFT,”Proc. IEEE Int. Comp., Acoust. Speech Signal Process., Hartford, Connecticut, 1977, pp. 366–368.
CM. Rader, “Discrete Fourier transforms when the numbers of data samples is prime,”Proc. IEEE vol.56, 1968, pp. 1107–1108.
H.J. Nussbaumer, “Fast computations of discrete Fourier transforms using polynomial transforms,”IEEE Trans. Acoust. Speech and Signal Processing, vol. ASSP-27, 1979, pp. 169–181.
CM. Rader and N.M. Brenner, “A new principle for fast Fourier transformation,”IEEE Trans. Acoust. Speech and Signal Processing, vol. ASSP-25, 1976, pp. 264–265.
D.P. Kolba and T.W. Parks, “A prime factor FFT algorithm using high-speed convolution,”IEEE Trans. Acoust. Speech and Signal Processing, vol. ASSP-25, 1977, pp. 90–103.
J.B. Martens, “Recursive cyclotomic factorization—A new algorithm for calculating the discrete Fourier transform,”IEEE Trans. Acoust. Speech and Signal Processing, vol. ASSP-32, 1984, pp. 750–761.
P. Duhamel and H. Hollmann, “Split radix FFT algorithm,”Electronic Letters, vol. 20, 1984, pp. 14–16.
E. Dubios and A. Venetsanopoulos, “A new algorithm for the Radix-3 FFT,”IEEE Trans. Acoust. Speech Signal Processing, vol. ASSP-26, 1978, pp. 222–225.
S. Prakash and V.V. Rao, “A new Radix-6 FFT algorithm,”IEEE Trans. Acoust. Speech and Signal Processing, vol. ASSP-29, 1981, pp. 939–941.
H.J. Nussbaumer and P. Quandalle, “Computation of convolutions and discrete Fourier transforms by polynomial transforms,”IBM J. Res. Dev., vol. 22, 1978, pp. 134–144.
G. Goertzel, “An algorithm for the evaluation of finite Fourier series,”Amer. Math Monthly, vol. 65, 1958, pp. 34–35.
G.H. Hostetter, “Recursive discrete Fourier transformation,”IEEE Trans. Acoust. Speech and Signal Processing, vol. ASSP-28, 1980, pp. 184–190.
C.W. Barnes and Hwang Chung, “Recursive computation of discrete transforms—A state-space approach,” Submitted to theProceedings of the IEEE, Invited Paper.
K.L. Caspari, “Generalized spectral analysis,”Proceedings of the 1970 Symposium and Workshop on Applications of Walsh Functions, Naval Research Laboratory and University of Maryland, Washington, D.C.
G. Bongiovanni, “Two VLSI structures for the discrete Fourier transform,”IEEE Trans. on Computers, vol. C-32, 1983.
G. Bongiovanni, “A VLSI network for variable size FFTs,”IEEE Trans. on Computers, vol. C-32, 1983.
M.A. Ghouse, “Modular hardware realizations of the discrete Fourier transform, the generalized Fourier transform, and the separable multidimensional cyclic convolution,” Ph.D. Dissertation, University of California at Irvine, Irvine, 1988.
CD. Thompson, “Fourier transforms in VLSI,”IEEE Trans. on Computers, vol. C-32, 1983, pp. 1047–1057.
R.M. Owens and M.J. Irwin, “The arithmetic cube,”IEEE Trans. on Computers, vol. C-36, 1987, pp. 1342–1348.
C. Mead and L. Conway,Introduction to VLSI Systems, New York: Addison-Wesley, 1980.
CD. Thompson, “A complexity theory for VLSI,” Ph.D. Dissertation, Carnegie-Mellon University, August 1980.
B. Chazelle and L. Monier, “A model of computation for VLSI with related complexity results,”Proc. 13th Annu. ACM Symp., Theory of Computing, pp. 318–325, 1981.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ghouse, M.A. 2D grid architectures for the DFT and the 2D DFT. J VLSI Sign Process Syst Sign Image Video Technol 5, 57–74 (1993). https://doi.org/10.1007/BF01880272
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01880272