A Mesh-Connected Area-Time Optimal VLSI Multiplier of Large Integers

Authors:
F. P. Preparata
Affiliations:
Coordinated Science Laboratory and the Departments of Electrical Engineering and Computer Science, University of Illinois
Venue:
IEEE Transactions on Computers
Year:
1983

Citing 8
Cited 4

The Area-Time Complexity of Binary Multiplication

Journal of the ACM (JACM)
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
Information transfer and area-time tradeoffs for VLSI multiplication

Communications of the ACM
Introduction to VLSI Systems

Introduction to VLSI Systems
Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Area-time complexity for VLSI

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A complexity theory for VLSI

A complexity theory for VLSI
A Combinatorial Limit to the Computing Power of VLSI Circuits

IEEE Transactions on Computers

The arithmetic cube

IEEE Transactions on Computers
Integration letter: A compact and modular VLSI design for the solution of general sparse linear systems

Integration, the VLSI Journal
An architecture for a VLSI FFT processor

Integration, the VLSI Journal
Paper: Parallel strong orientation on a mesh connected computer

Parallel Computing

Quantified Score

Hi-index	14.98

Visualization

Abstract

This paper describes a VLSI network for the multiplication of two N-bit integers, for very large N. The network, with its area 0(N) and operation time 0(vN), matches, within a constant factor, the known theoretical O(N2) lower bound to the area × (time)2measure of complexity in the VLSI model of computation. The network, which is based on the discrete Fourier transform, has a