Sciweavers

210 search results - page 30 / 42
» Widening Integer Arithmetic
Sort
View
IPL
2007
111views more  IPL 2007»
13 years 7 months ago
Powering requires threshold depth 3
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
Alexander A. Sherstov
JCT
2010
113views more  JCT 2010»
13 years 5 months ago
Equations resolving a conjecture of Rado on partition regularity
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
Boris Alexeev, Jacob Tsimerman
DAC
2004
ACM
14 years 8 months ago
Automated fixed-point data-type optimization tool for signal processing and communication systems
A tool that automates the floating-point to fixed-point conversion (FFC) process for digital signal processing systems is described. The tool automatically optimizes fixed-point d...
Changchun Shi, Robert W. Brodersen
LFCS
2007
Springer
14 years 1 months ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang
GLVLSI
2007
IEEE
166views VLSI» more  GLVLSI 2007»
13 years 11 months ago
Efficient pipelining for modular multiplication architectures in prime fields
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...
Nele Mentens, Kazuo Sakiyama, Bart Preneel, Ingrid...