ARITH
2005
IEEE
13 years 10 months ago
2005
IEEE
We are proposing a micro-architecture for highperformance IEEE floating-point addition that is based on a (non-redundant)high-radix representation of the floatingpoint operands....
ARITH
2005
IEEE
13 years 10 months ago
2005
IEEE
Integer division on modern processors is expensive compared to multiplication. Previous algorithms for performing unsigned division by an invariant divisor, via reciprocal approxi...
ARITH
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
ARITH
2005
IEEE
13 years 10 months ago
2005
IEEE
We introduce an inheritance property and related table lookup structures applicable to simplified evaluation of the modular operations “multiplicative inverse”, “discrete l...
ARITH
2005
IEEE
13 years 10 months ago
2005
IEEE
ARITH
2005
IEEE
13 years 10 months ago
2005
IEEE
In a search for an algorithm to compute atan(x) which has both low latency and few floating point instructions, an interesting variant of familiar trigonometry formulas was disco...
ARITH
2005
IEEE
13 years 10 months ago
2005
IEEE
This paper presents a set of tools for mechanical reasoning of numerical bounds using interval arithmetic. The tools implement two techniques for reducing decorrelation: interval ...
ARITH
2005
IEEE
13 years 10 months ago
2005
IEEE
This paper describes an improved version of the Tenca-Koç unified scalable radix-2 Montgomery multiplier with half the latency for small and moderate precision operands and half ...
ARITH
2005
IEEE
13 years 10 months ago
2005
IEEE
In this paper we propose an architecture for the computation of the double—precision floating—point multiply—add fused (MAF) operation A + (B × C) that permits to compute ...
ARITH
2005
IEEE
13 years 10 months ago
2005
IEEE