Method and apparatus for simultaneously multiplying two or more

Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 1716

Patent

active

060852135

ABSTRACT:
A multiplier capable of performing signed and unsigned scalar and vector multiplication is disclosed. The multiplier is configured to receive signed or unsigned multiplier and multiplicand operands in scalar or packed vector form. An effective sign for the multiplier and multiplicand operands may be calculated based upon each operand's most significant bit and a control signal. The effective signs may then be used to create and select a number of partial products according to Booth's algorithm. Once the partial products have been created and selected, they may be summed and the results may be output. The results may be signed or unsigned, and may represent vector or scalar quantities. When a vector multiplication is performed, the multiplier may be configured to generate and select partial products so as to effectively isolate the multiplication process for each pair of vector components. The multiplier may also be configured to sum the products of the vector components to form the vector dot product. The final product may be output in segments so as to require fewer bus lines. The segments may be rounded by adding a rounding constant. Rounding and normalization may be performed in two paths, one assuming an overflow will occur, the other assuming no overflow will occur.

REFERENCES:
patent: 4736335 (1988-04-01), Barkan
patent: 4849923 (1989-07-01), Samudrala et al.
patent: 4884232 (1989-11-01), Schlunt
patent: 5032865 (1991-07-01), Schlunt
patent: 5343416 (1994-08-01), Eisig et al.
patent: 5369607 (1994-11-01), Okamoto
patent: 5606677 (1997-02-01), Balmer et al.
patent: 5847981 (1998-12-01), Kelley et al.
patent: 5953241 (1999-09-01), Hansen et al.
A.D. Booth, "A signed binary multiplication technique," Quarterly Journal of Mechanics and Applied Mathematics, vol. 4, No. 2, pp. 236-240, 1951.
W.S. Briggs and D.W. Matula, "A 17.times.69 Bit multiply and add unit with redundant binary feedback and single cycle latency," in Proceedings of the 11.sup.th IEEE Symposium on Computer Arithmetic, Jul. 1993, pp. 163-170.
D.L. Fowler and J.E. Smith, "An accurate, high speed implementation of division by reciprocal approximation," in Proceedings of the 9.sup.th IEEE Symposium on Computer Arithmetic, Sep. 1989, pp. 60-67.
J.A. Kowaleski, et al, "A dual execution pipelined floating-point CMOS processor," in Digest of Technical Papers, IEEE International Solid-State Circuits Conference, 1996, pp. 358-359.
N.T. Quach, et al, "On fast IEEE rounding," Technical Report No. CSL-TR-91-459, Computer Systems Laboratory, Standford University, Jan. 1991.
M.R. Santoro, et al, "Rounding algorithms for IEEE multipliers," in Proceedings of the 9.sup.th IEEE Symposium on Computer Arithmetic, Sep. 1989, pp. 176-183.
H.P. Sit, et al, "An 80 MFLOPS floating-point engine in the Intel i860 processor," in Digest of Technical Papers, IEEE International Conference on Computer Design, 1989, pp. 374-379.
Hennessy & Patterson, "Computer Architecture: A Quantitative Approach," Appendix A (pp. A-2 to A-53), Morgan Kaufmann Publishers, Inc., 1990.
Yu & Zyner, "167 MHz Radix-4 Floating Point Multiplier," SPACR Technology Business, Sun Microsystems, Inc., Sunnyvale, California, pp. 149-154.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and apparatus for simultaneously multiplying two or more does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for simultaneously multiplying two or more , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for simultaneously multiplying two or more will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1495485

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.