1108 search results - page 55 / 222 » Algorithm Transformation for FPGA Implementation |
100
click to vote
FPL
2007
Springer
15 years 8 months ago
2007
Springer
Simple algorithms can be analytically characterized, but such analysis is questionable or even impossible for more complicated algorithms, such as Model Predictive Control (MPC). ...
131
click to vote
FPGA
2009
ACM
15 years 8 months ago
2009
ACM
Modern Field Programmable Gate Arrays (FPGAs) are capable of performing complex discrete signal processing algorithms with clock rates above 100MHz. This combined with FPGA’s lo...
104
click to vote
FPGA
2007
ACM
15 years 8 months ago
2007
ACM
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
109
click to vote
CHES
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Recently, Lenstra and Verheul proposed an efficient cryptosystem called XTR. This system represents elements of F p6 with order dividing p2 -p+1 by their trace over Fp2 ....
173
click to vote
TSE
2011
14 years 8 months ago
2011
In this paper we present a case study in deriving an algorithm from a formal specification via FermaT transformations. The general method (which is presented in a separate paper)...