Overflow prediction algorithm and logic for high speed...

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

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C708S552000

Reexamination Certificate

active

06947962

ABSTRACT:
An algorithm and implementation is described of overflow prediction for addition without the use of an expensive addition operation. This overflow prediction is particularly applicable to the implementation of addition operation using the carry-save format in high speed arithmetic units.

REFERENCES:
patent: 4592008 (1986-05-01), Nopper
patent: 5260890 (1993-11-01), Suzuki
patent: 5745397 (1998-04-01), Nadehara
patent: 6334135 (2001-12-01), Kabuo
patent: 6633895 (2003-10-01), Bass et al.
H. Suzuki et al, “Leading Zero Anticipatory Logic for High Speed Floating Point Addition”, IEEE Journal of Solid-State Circuits, vol. 31, No. 8, Aug. 1996 pp. 1157-1164.
K.T. Lee and K.J. Nowka, “1Ghz Leading Zero Anticipator Using Independent Sign-Bit Determination Logic”, 2000 Symposium on VLSI Circuits Digest of Technical Papers, pp. 194-195.
E. Hokenek et al, “Second Gemation RISC Floating Point with Multiply-Add Fused”, IEEE Journal on Solid-State Circuits, vol. 25, No. 5, Oct. 1990, pp. 1207-1213.

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

Overflow prediction algorithm and logic for high speed... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Overflow prediction algorithm and logic for high speed..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Overflow prediction algorithm and logic for high speed... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3431297

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