Performing binary multiplication using minimal path algorithm

Details Performing binary multiplication using minimal path algorithm Performing binary multiplication using minimal path algorithm

1987-05-19

1989-04-18

Harkcom, Gary V.

Boots, shoes, and leggings

364754, G06F 752

Patent

active

048233005

ABSTRACT:
A binary multiplier architecture which performs two's complement multiplication when the multiplier has 1's in more than half of its bits and performs unsigned binary multiplication by adding only shifted multiplicand vectors as a function of the multiplier all other times. Two's complement multiplication is performed by adding a multiplicand and a multiplier to two's complemented shifted multiplicand vectors as a function of the two's complement of the multiplier. To reduce the number of additions necessary, portions of the operands are merged with the shifted complemented vectors prior to addition of the shifted vectors. Carry lookahead may be provided to increase the speed.

REFERENCES:
patent: 4546446 (1985-10-01), Machida
patent: 4638449 (1987-01-01), Frey
patent: 4646257 (1987-02-01), Essig et al.
Finn, "LSI Hardware Implements Signal Processing Algorithms", Computer Design, vol. 19, No. 3, Mar. 1980, pp. 137-142.

Affiliated with

Also associated with

Rating

Performing binary multiplication using minimal path algorithm does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Performing binary multiplication using minimal path algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performing binary multiplication using minimal path algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2400426