Communications of the ACM

Home/Magazine Archive/January 1980 (Vol. 23, No. 1)/Information transfer and area-time tradeoffs for VLSI.../Abstract

Information transfer and area-time tradeoffs for VLSI multiplication

By Harold Abelson, Peter Andreae
Communications of the ACM, January 1980, Vol. 23 No. 1, Pages 20-23
10.1145/358808.358814
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

The need to transfer information between processing elements can be a major factor in determining the performance of a VLSI circuit. We show that communication considerations alone dictate that any VLSI design for computing the 2n-bit product of two n-bit integers must satisfy the constraint AT2 ≥ n2/64 where A is the area of the chip and T is the time required to perform the computation. This same tradeoff applies to circuits which can shift n-bit words through n different positions.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.