Area-time optimal VLSI networks for computing integer multiplication and Discrete Dourier Transform

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 115 LNCS, Issue , 1981, Pages 29-40

  Preparata, F P ^a   Vuillemin, J E ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b Laboratoire Interdisciplinaire des Sciences du Numérique   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DISCRETE FOURIER TRANSFORMS;

BIT INTEGERS; CONSTANT FACTORS; INTEGER MULTIPLICATIONS; LOWER BOUNDS; TIME-OPTIMAL;

VLSI CIRCUITS;

EID: 0347777948     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-10843-2_3     Document Type: Conference Paper

References (14)

1. C. Mead and L. Conway, Introduction to VLSI Systems, Addison-Wesley, Reading, Mass., 1979.
2. 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.
3. C. D. Thompson, “A complexity theory for VLSI,” Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Penn., 1980.
4. 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.
5. 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.
6. 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.
7. H. T. Kung and C. E. Leiserson, “Algorithms for VLSI processor arrays,” Symposium on Sparse Matrix Computations, Knoxville, Tenn., Nov. 1978.
8. 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.
9. 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.
10. 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.
11. 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.
12. 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.
13. H. S. Stone, “Parallel processing with the perfect shuffle,” IEEE Transactions on Computers, vol. C-20, pp. 153–161; 1971.
14. A. Schönhage and V. Strassen, “Schnelle Multiplikation grosser Zahlen,” Computing, vol. 7, pp. 281–292; 1971.