Sciweavers

26 search results - page 5 / 6
» Arithmetic with Signed Analog Digits
Sort
View
DAC
2007
ACM
14 years 7 months ago
Optimization of Area in Digital FIR Filters using Gate-Level Metrics
In the paper, we propose a new metric for the minimization of area in the generic problem of multiple constant multiplications, and demonstrate its effectiveness for digital FIR f...
Eduardo A. C. da Costa, José C. Monteiro, L...
EUROCRYPT
1998
Springer
13 years 10 months ago
How to Improve an Exponentiation Black-Box
Abstract. In this paper we present a method for improving the performance of RSA-type exponentiations. The scheme is based on the observation that replacing the exponent d by d = d...
Gérard D. Cohen, Antoine Lobstein, David Na...
ICCD
2001
IEEE
103views Hardware» more  ICCD 2001»
14 years 3 months ago
Improved ZDN-arithmetic for Fast Modulo Multiplication
In 1987 Sedlak proposed a modulo multiplication algorithm which is suitable for smart card implementation due to it’s low latency time. It is based on ZDN (zwei_drittel_N) arith...
Hagen Ploog, Sebastian Flügel, Dirk Timmerman...
FSTTCS
2010
Springer
13 years 4 months ago
Computing Rational Radical Sums in Uniform TC^0
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
Paul Hunter, Patricia Bouyer, Nicolas Markey, Jo&e...
ICMCS
2005
IEEE
116views Multimedia» more  ICMCS 2005»
13 years 12 months ago
Lossless image compression with tree coding of magnitude levels
With the rapid development of digital technology in consumer electronics, the demand to preserve raw image data for further editing or repeated compression is increasing. Traditio...
Hua Cai, Jiang Li