Speed enhancement for multipliers using minimal path algorithm

Details Speed enhancement for multipliers using minimal path algorithm Speed enhancement for multipliers using minimal path algorithm

1987-12-14

1989-09-19

Harkcom, Gary V.

Boots, shoes, and leggings

364754, G06F 752

Patent

active

048687782

ABSTRACT:
A binary multiplier architecture which multiplies signed and unsigned operands as unsigned numbers and adds a correction factor which is the two's complement of the other operand if the operand is signed. The multiplier architecture 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 to the shifted vectors.

REFERENCES:
patent: 3627999 (1971-12-01), Iverson
patent: 3761699 (1973-09-01), Sather
patent: 3866030 (1975-02-01), Baugh et al.
patent: 4086474 (1978-04-01), Negi et al.
patent: 4507749 (1985-03-01), Ohhashi
patent: 4644491 (1987-02-01), Ookawa et al.
patent: 4761756 (1988-08-01), Lee et al.
Capps et al., "Two's Complement Multiplication,", IBM Tech. Disclosure Bulletin, vol. 20, No. 12, May 1978, pp. 5292-5293.
Robertson, "Two's Complement Multiplication in Binary Parallel Digital Computers", IRE-Trans.-Electronic Computers, Sep. 1955, pp. 118-119.
Davby et al., "Two Complement Multiplier", IBM Tech. Disclosure Bulletin, vol. 18, No. 5, Oct. 1975, pp. 1482-1483.

Affiliated with

Also associated with

Rating

Speed enhancement for multipliers 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 Speed enhancement for multipliers using minimal path algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Speed enhancement for multipliers using minimal path algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-374276