Optimal VLSI architectures for multidimensional DFT

[1]  Izidor Gertner,et al.  VLSI Architectures for Multidimensional Fourier Transform Processing , 1987, IEEE Transactions on Computers.

[2]  Ondrej Sýkora,et al.  Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard Transformations , 1985, Inf. Process. Lett..

[3]  Willem J. D. Steenaart,et al.  A high speed two-dimensional FFT processor , 1984, ICASSP.

[4]  David Y. Y. Yun,et al.  Multi-dimensional systolic networks, for discrete fourier transform , 1984, ISCA 1984.

[5]  Thompson.  Fourier Transforms in VLSI , 1983, IEEE Transactions on Computers.

[6]  S. N. Maheshwari,et al.  Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees , 1983, IEEE Transactions on Computers.

[7]  Jean Vuillemin,et al.  A Combinatorial Limit to the Computing Power of VLSI Circuits , 1983, IEEE Transactions on Computers.

[8]  Frank Thomson Leighton,et al.  New lower bound techniques for VLSI , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[9]  F. Preparata,et al.  Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform , 1981, ICALP.

[10]  H. T. Kung,et al.  The Area-Time Complexity of Binary Multiplication , 1981, JACM.

[11]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[12]  Harold Abelson,et al.  Information transfer and area-time tradeoffs for VLSI multiplication , 1980, CACM.

[13]  C. Thomborson,et al.  A Complexity Theory for VLSI , 1980 .

[14]  C. Thompson.  Area-time complexity for VLSI , 1979, STOC 1979.

[15]  G. Rivard.  Direct fast Fourier transform of bivariate functions , 1977 .

[16]  J. McClellan,et al.  Vector radix fast Fourier transform , 1977 .

[17]  C. Burrus,et al.  Number theoretic transforms to implement fast digital convolution , 1975, Proceedings of the IEEE.

[18]  J. Pollard,et al.  The fast Fourier transform in a finite field , 1971 .

[19]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .