Abstract
In this paper we present a class of VLSI networks for computing the Discrete Fourier Transform and the product of two N-bit integers. These networks match, within a constant factor, the known theoretical lower-bound O(N2) to the area × (time)2 measure of complexity. While this paper's contribution is mainly theoretical, it points toward very practical directions: we show how to design multipliers with area A = O(N) and time T=O(√N) on one hand, and A=0((N/log2N)2), T = O(log2N) on the other. Both of these designs should be contrasted with the currently available multipliers, whose performances are A=O(N), T=O(N) or even A=O(N2), T=O(N).
His work was supported in part by the National Science Foundation under Grant MCS 78-13642 and the Joint Services Electronics Program under Contract N00014-79-C-0424.
His work was supported in part by ERA 452 "al Khowarizmi" of the C.N.R.S.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
C. Mead and L. Conway, Introduction to VLSI Systems, Addison-Wesley, Reading, Mass., 1979.
C. D. Thompson, "Area-time complexity for VLSI," Proc. of the 11th Annual ACM Symposium on the Theory of Computing (SIGACT), pp. 81–88, May 1979.
C. D. Thompson, "A complexity theory for VLSI," Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Penn., 1980.
R. P. Brent and H. T. Kung, "The chip complexity of binary arithmetic," Proc. of 12th ACM Symposium on Theory of Computing, (Los Angeles), pp. 190–200, May 1980.
J. E. Vuillemin, "A combinatorial limit to the computing power of VLSI circuits," Proc. 21st Symposium on Foundation of Computer Science, (Syracuse), pp. 294–300, Oct., 1980.
H. Abelson and P. Andreae, "Information transfer and area-time trade-offs for VLSI multiplication," Communications of the ACM, vol. 23, n. 1, pp. 20–22; January, 1980.
H. T. Kung and C. E. Leiserson, "Algorithms for VLSI processor arrays," Symposium on Sparse Matrix Computations, Knoxville, Tenn., Nov. 1978.
L. J. Guibas, H. T. Kung, and C. D. Thompson, "Direct VLSI implementation of combinatorial algorithms," Proc. Conference on VLSI Architecture, Design, Fabrication, Calif. Inst. of Techn., January 1979.
J. E. Savage, "Area-time tradeoffs for matrix multiplication and transitive closure in the VLSI model," Proc. of the 17th Annual Allerton Conference on Communications, Control, and Computing, October 1979.
F. P. Preparata and J. Vuillemin, "The cube-connected-cycles: a versatile network for parallel computation," (Extended Abstract), Proceedings of 20-th Annual IEEE Symposium on Foundations of Computer Science, Puerto Rico, October 1979.
F. P. Preparata and J. Vuillemin, "Area-time optimal VLSI networks for multiplying matrices," Information Processing Letters, vol. 11, n. 2, pp. 77–80, October 1980.
F. P. Preparata and J. Vuillemin, "Optimal integrated-circuit implementation of triangular matrix inversion," 1980 International Conference on Parallel Processing, Boyne, Mich., pp. 211–216, Aug. 1980.
H. S. Stone, "Parallel processing with the perfect shuffle," IEEE Transactions on Computers, vol. C-20, pp. 153–161; 1971.
A. Schönhage and V. Strassen, "Schnelle Multiplikation grosser Zahlen," Computing, vol. 7, pp. 281–292; 1971.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Preparata, F.P., Vuillemin, J.E. (1981). Area-time optimal VLSI networks for computing integer multiplication and Discrete Dourier Transform. In: Even, S., Kariv, O. (eds) Automata, Languages and Programming. ICALP 1981. Lecture Notes in Computer Science, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10843-2_3
Download citation
DOI: https://doi.org/10.1007/3-540-10843-2_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10843-6
Online ISBN: 978-3-540-38745-9
eBook Packages: Springer Book Archive