Method and a circuit using an associative calculator for...

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

C708S501000

Reexamination Certificate

active

07991817

ABSTRACT:
An apparatus and method that use an associative calculator for calculating a sequence of non-associative operations on a set of input data, comprising: using the associative calculator to calculate from the set of input data an evaluated value of each operation of said sequence as if the non-associative operations were associative operations; detecting if some of the evaluated values are erroneous; if there are erroneous evaluated values, correcting the erroneous evaluated values; and if there are no erroneous evaluated value, outputting as the result of the sequence of non-associative operations the evaluated value of the last operation of the sequence.

REFERENCES:
patent: 7212959 (2007-05-01), Purcell et al.
patent: 7620945 (2009-11-01), Song et al.
Schulte et al., “Parallel Saturating Multioperand Adders”, pp. 172-179, 2000.
Balzola et al., “Design Alternatives for Parallel Saturating Multioperand Adders”, 2001 IEEE, pp. 172-177.
I.S. Committee, IEEE Standard for Binary Floating-Point Arithmetic, IEEE, 345 East 47thStreet, New York, NY 10017, Jul. 1985, ANSI/IEEE Std 754-1985.
C. McNairy et al. “Itanium 2 Processor Microarchitecture,” IEEE Micro, vol. 23, No. 2, pp. 44-55, Mar./Apr. 2003.
K.S. Hemmert et al., “Open Source High Performance floating-point modules,” in Proceedings of the IEEE Symposium on Field-Programmable Custom Computing Machines, Apr. 2006.
H. Leuprecht et al. “Parallel algorithms for rounding exact summation of floating point numbers,” Computing, vol. 28, pp. 89-104, 1982.
S.M. Rump et al. “Accurate floating-point Summation,” Faculty of Information and Communication Science, Hamburg University of Technology, Institute for Reliable Computing, Hamburg University of Technology, Schwarzenbergstrasse 95, Hamburg 21071, Germany, tech. rep. 05.12, Nov. 2005.
Z. Luo et al., “Accelerating pipelined integer and floating-point accumulations in configurable hardware with delaye addition techniques,” IEEE Transactions on Computers, vol. 49, No. 3, pp. 208-218, Mar. 2000.
R.P. Brent et al. “A regular layout for parallel adders,” IEEE Transactions on Computers, vol. 31, No. 3, pp. 260-264, Mar. 1982.
J. Sklanksy, “Conditional-sum addiction logic,” IRE Transactions of Electronic Computers, vol. EC-9, pp. 226-231, Jun. 1960.
P. Kogge et al. “A parallel algorithm for the efficient solution of a general class of recurrence equations,” IEEE Transactions on Computers, vol. C-22, No. 8, pp. 786-793, Aug. 1973.
T. Han et al., “Fast area-efficient VLSI adders,” in 8thSymposium of computer Arithmetic, pp. 49-56, Sep. 1987.
W.D. Hillis et al., “Data parallel algorithms,” Communications of the ACM, vol. 29 , No. 12, pp. 1170-1183, Dec. 1986.
R. Kelsey et al., “Revised report on the algorithmic language scheme,” Higher-Order and Symbolic Computation, vol. 11, No. 1, Aug. 1998.
K. Underwood, “FPGAs vs. CPUs : Trends in Peak Floating-Point Performance,” in Proceedings of the International Symposium on Field-Programmable Gate Arrays, Feb. 2004, pp. 171-180. Morgan Kaufmann.

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 a circuit using an associative calculator for... 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 a circuit using an associative calculator for..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and a circuit using an associative calculator for... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2769495

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