Sciweavers

2634 search results - page 21 / 527
» Faster Than Uppaal
Sort
View
ICCD
2003
IEEE
177views Hardware» more  ICCD 2003»
14 years 4 months ago
SAT-Based Algorithms for Logic Minimization
This paper introduces a new method for two-level logic minimization. Unlike previous approaches, the new method uses a SAT solver as an underlying engine. While the overall minimi...
Samir Sapra, Michael Theobald, Edmund M. Clarke
CHES
2004
Springer
128views Cryptology» more  CHES 2004»
14 years 27 days ago
Long Modular Multiplication for Cryptographic Applications
Abstract. A digit-serial, multiplier-accumulator based cryptographic coprocessor architecture is proposed, similar to fix-point DSP's with enhancements, supporting long modula...
Laszlo Hars
ARC
2008
Springer
99views Hardware» more  ARC 2008»
13 years 9 months ago
Accelerating Speculative Execution in High-Level Synthesis with Cancel Tokens
We present an improved method for scheduling speculative data paths which relies on cancel tokens to undo computations in misspeculated paths. Performancewise, this method is consi...
Hagen Gädke, Andreas Koch
ASIACRYPT
2001
Springer
14 years 12 hour ago
Speeding Up XTR
This paper describes several speedups and simpliļ¬cations for XTR. The most important results are new XTR double and single exponentiation methods where the latter requires a chea...
Martijn Stam, Arjen K. Lenstra
ICIP
2002
IEEE
14 years 9 months ago
Reduced DCT approximations for low bit rate coding
Transform approximations are explored for speeding up the software compression of images and video. Faster approximations are used to replace the regular DCT whenever only few DCT...
Ricardo L. de Queiroz