Browse Prior Art Database

High Speed Binary Parallel Multiplication

IP.com Disclosure Number: IPCOM000094273D
Original Publication Date: 1966-Aug-01
Included in the Prior Art Database: 2005-Mar-06
Document File: 1 page(s) / 11K

Publishing Venue

IBM

Related People

Ling, H: AUTHOR

Abstract

To either sum a series or to square a number or to multiply any two numbers together can be expressed generally in terms of multiplication. The repetition of addition, shift and add, has been the main method for performing the multiplication in computers. The larger the number is, the longer the time required to complete the operation.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 1

High Speed Binary Parallel Multiplication

To either sum a series or to square a number or to multiply any two numbers together can be expressed generally in terms of multiplication. The repetition of addition, shift and add, has been the main method for performing the multiplication in computers. The larger the number is, the longer the time required to complete the operation.

The method described in this article performs the summation of a series with one clock pulse, squares a number with two clock pulses, and multiplies any two numbers with three clock pulses. The length of the number does not affect the operating time. Only the logic elements do.

Let A and B be the two numbers which are to be multiplied together where A and B can be represented as

(Image Omitted)

(Image Omitted)

(Image Omitted)

(Image Omitted)

(Image Omitted)

(Image Omitted)

1