Sciweavers

30 search results - page 5 / 6
» arith 2005
Sort
View
ARITH
2005
IEEE
14 years 1 months ago
Efficient Mapping of Addition Recurrence Algorithms in CMOS
Efficient adder design requires proper selection of a recurrence algorithm and its realization. Each of the algorithms: Weinberger’s, Ling’s and Doran’s were analyzed for it...
Bart R. Zeydel, Theo T. J. H. Kluter, Vojin G. Okl...
ARITH
2005
IEEE
13 years 9 months ago
Long Number Bit-Serial Squarers
New bit serial squarers for long numbers in LSB first form, are presented in this paper. The first presented scheme is a 50% operational efficient squarer than has the half number...
E. Chaniotakis, Paraskevas Kalivas, Kiamal Z. Pekm...
ARITH
2005
IEEE
14 years 1 months ago
The Residue Logarithmic Number System: Theory and Implementation
— The Residue Logarithmic Number System (RLNS) represents real values as quantized logarithms which, in turn, are represented using the Residue Number System (RNS). Compared to t...
Mark G. Arnold
ARITH
2005
IEEE
13 years 9 months ago
Quasi-Pipelined Hash Circuits
Hash functions are an important cryptographic primitive. They are used to obtain a fixed-size fingerprint, or hash value, of an arbitrary long message. We focus particularly on ...
Marco Macchetti, Luigi Dadda
ARITH
2005
IEEE
14 years 1 months ago
A Linear-System Operator Based Scheme for Evaluation of Multinomials
We present a radix-2 online computational scheme for evaluating multinomials in a fixed-point number representation system. Its main advantage is that it can adapt to any evaluat...
Pavan Adharapurapu, Milos D. Ercegovac