Proceedings Article10.1109/ARITH.1989.72825
Cascade: hardware for high/variable precision arithmetic
Tony M. Carter
- 06 Sep 1989
- pp 184-191
TL;DR: The Cascade hardware architecture for high/variable precision arithmetic uses a radix-16 redundant signed-digit number representation and provides a complete suite of memory management functions implemented in hardware, including a garbage collector.
read more
Abstract: The Cascade hardware architecture for high/variable precision arithmetic is described. It uses a radix-16 redundant signed-digit number representation and directly supports single or multiple precision addition, subtraction, multiplication, division, extraction of the square root, and computation of the greatest divisor. It is object-oriented and implements an abstract class of objects, variable precision integers. It provides a complete suite of memory management functions implemented in hardware, including a garbage collector. The Cascade hardware permits free tradeoffs of space versus time. >
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A family of variable-precision interval arithmetic processors
TL;DR: Hardware designs, arithmetic algorithms, and software support for a family of variable-precision, interval arithmetic processors that give the programmer the ability to detect and, if desired, to correct implicit errors in finite precision numerical computations.
88
Hardware design and arithmetic algorithms for a variable-precision, interval arithmetic coprocessor
M.J. Schulte,E.E. Swartzlander +1 more
- 19 Jul 1995
TL;DR: This paper presents the hardware design and arithmetic algorithms for a coprocessor that performs variable-precision, interval arithmetic that can be implemented on a single chip with a cycle time that is comparable to IEEE double- precision floating pointCoprocessors.
38
Radix-16 signed-digit division
T.M. Carter,James E. Robertson +1 more
TL;DR: A two-stage algorithm for fixed point, radix-16 signed-digit division is presented and can be extended to other radices as long as the signed-digital number representation used has certain properties.
36
Software and Hardware Techniques for Accurate, Self-Validating Arithmetic
Michael J. Schulte,Earl E. SwartzlanderJr. +1 more
- 01 Jan 1996
TL;DR: This survey examines various software and hardware techniques for accurate, self-validating arithmetic and discusses their strengths and limitations and numerical applications that employ these tools to produce accurate and reliable results.
20
Variable-precision, interval arithmetic coprocessors
TL;DR: This paper presents hardware designs, arithmetic algorithms, and numerical applications for variable-precision, interval arithmetic coprocessors that give the programmer the ability to set the initial precision of the computation, determine the accuracy of the results, and recompute inaccurate results with higher precision.
15
References
Signed-Digit Numbe Representations for Fast Parallel Arithmetic
TL;DR: Sign-digit representations limit carry-propagation to one position to the left during the operations of addition and subtraction in digital computers and arithmetic operations with signed-digit numbers: addition, subtraction, multiplication, division and roundoff are discussed.
1.2K
Balanced delay trees and combinatorial division in VLSI
D. Zuras,W.H. McAllister +1 more
TL;DR: Three floating-point arithmetic chips have been implemented in 1.5-/spl mu/m NMOS technology utilizing several novel circuit designs and a method is presented for constructing balanced delay trees that have a better area-time product than binary trees.
58
Radix-16 signed-digit division
T.M. Carter,James E. Robertson +1 more
TL;DR: A two-stage algorithm for fixed point, radix-16 signed-digit division is presented and can be extended to other radices as long as the signed-digital number representation used has certain properties.
36
Modelling volumes bounded by b-spline surfaces
Spencer Woodlief Thomas
- 01 Jan 1984
TL;DR: In this article, the B-spline boundaries of this method need not be closed, but must only satisfy a weak completion criterion, which is similar to the one in this paper.
33