Sciweavers

23 search results - page 2 / 5
» arith 2003
Sort
View
ARITH
2003
IEEE
13 years 10 months ago
On-Line Multiplication in Real and Complex Base
Multiplication of two numbers represented in base   is shown to be computable by an on-line algorithm when   is a negative integer, a positive non-integer real number, or a comp...
Christiane Frougny, Athasit Surarerks
ARITH
2003
IEEE
13 years 10 months ago
Saturating Counters: Application and Design Alternatives
We define a new class of parallel counters, Saturating Counters, which provide the exact count of the inputs that are 1 only if this count is below a given threshold. Such counte...
Israel Koren, Yaron Koren, Bejoy G. Oomman
ARITH
2003
IEEE
13 years 10 months ago
Scaling an RNS Number Using the Core Function
This paper introduces a method for extracting the core of a Residue Number System (RNS) number within the RNS, this affording a new method for scaling RNS numbers. Suppose an RNS ...
Neil Burgess
ARITH
2003
IEEE
13 years 10 months ago
Some Optimizations of Hardware Multiplication by Constant Matrices
This paper presents some improvements on the optimization of hardware multiplication by constant matrices. We focus on the automatic generation of circuits that involve constant m...
Nicolas Boullis, Arnaud Tisserand
ARITH
2003
IEEE
13 years 10 months ago
A VLSI Algorithm for Modular Multiplication/Division
We propose an algorithm for modular multiplication/division suitable for VLSI implementation. The algorithm is based on Montgomery’s method for modular multiplication and on the...
Marcelo E. Kaihara, Naofumi Takagi