Sciweavers

27 search results - page 3 / 6
» arith 2007
Sort
View
ARITH
2007
IEEE
15 years 10 months ago
Multiplication by a Constant is Sublinear
Abstract— This paper explores the use of the double-base number system (DBNS) for constant integer multiplication. The DBNS recoding scheme represents integers – in this case c...
Vassil S. Dimitrov, Laurent Imbert, Andrew Zakaluz...
ARITH
2007
IEEE
15 years 10 months ago
How to Ensure a Faithful Polynomial Evaluation with the Compensated Horner Algorithm
The compensated Horner algorithm improves the accuracy of polynomial evaluation in IEEE-754 floating point arithmetic: the computed result is as accurate as if it was computed wi...
Philippe Langlois, Nicolas Louvet
ARITH
2007
IEEE
15 years 10 months ago
Performing Advanced Bit Manipulations Efficiently in General-Purpose Processors
This paper describes a new basis for the implementation of a shifter functional unit. We present a design based on the inverse butterfly and butterfly datapath circuits that perfo...
Yedidya Hilewitz, Ruby B. Lee
ARITH
2007
IEEE
15 years 8 months ago
Robust Energy-Efficient Adder Topologies
In this paper we explore the relationship between adder topology and energy efficiency. We compare the energy-delay tradeoff curves of selected 32-bit adder topologies, to determi...
Dinesh Patil, Omid Azizi, Mark Horowitz, Ron Ho, R...
ARITH
2007
IEEE
15 years 10 months ago
Asymmetric Squaring Formulae
Abstract. We present efficient squaring formulae based on the Toom-Cook multiplication algorithm. The latter always requires at least one non-trivial constant division in the inte...
Jaewook Chung, M. Anwar Hasan