Sciweavers

104 search results - page 1 / 21
» A digit serial algorithm for the integer power operation
Sort
View
GLVLSI
2006
IEEE
101views VLSI» more  GLVLSI 2006»
13 years 10 months ago
A digit serial algorithm for the integer power operation
Lun Li, Mitchell A. Thornton, David W. Matula
CSREAESA
2006
13 years 6 months ago
Generalized Deterministic Task Scheduling Algorithm for Embedded Real-Time Operating Systems
- In recent years, there has been a rapid and wide spread proliferation of non-traditional embedded computing platforms such as digital camcorders, cellular phones, and portable me...
Myoung-Jo Jung, Moon-Haeng Cho, Yong-Hee Kim, Cheo...
CC
2010
Springer
117views System Software» more  CC 2010»
13 years 2 months ago
Efficiently Certifying Non-Integer Powers
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
Erich Kaltofen, Mark Lavin
SACRYPT
2004
Springer
113views Cryptology» more  SACRYPT 2004»
13 years 10 months ago
A Note on the Signed Sliding Window Integer Recoding and a Left-to-Right Analogue
Addition-subtraction-chains obtained from signed digit recodings of integers are a common tool for computing multiples of random elements of a group where the computation of invers...
Roberto Maria Avanzi
GLVLSI
2011
IEEE
351views VLSI» more  GLVLSI 2011»
12 years 8 months ago
Design of low-power multiple constant multiplications using low-complexity minimum depth operations
Existing optimization algorithms for the multiplierless realization of multiple constant multiplications (MCM) typically target the minimization of the number of addition and subt...
Levent Aksoy, Eduardo Costa, Paulo F. Flores, Jos&...