Sciweavers

471 search results - page 20 / 95
» Faster Multiplication in GF(2)[x]
Sort
View
CHES
2000
Springer
167views Cryptology» more  CHES 2000»
14 years 2 months ago
A High Performance Reconfigurable Elliptic Curve Processor for GF(2m)
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m ). This is a scalable architecture in terms of area and speed that exploits the abil...
Gerardo Orlando, Christof Paar
ICDE
1999
IEEE
134views Database» more  ICDE 1999»
14 years 11 months ago
On Similarity-Based Queries for Time Series Data
We study similarity queries for time series data where similarity is defined in terms of a set of linear transformations on the Fourier series representation of a sequence. We hav...
Davood Rafiei
CCGRID
2011
IEEE
13 years 1 months ago
Small Discrete Fourier Transforms on GPUs
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
S. Mitra, A. Srinivasan
ICASSP
2008
IEEE
14 years 4 months ago
Modulation decompositions for the interpolation of long gaps in acoustic signals
This paper presents a modulation-based reconstruction method for audio signals across long gaps of missing samples. We use LTI filterbanks followed by a multiplicative model that...
Pascal Clark, Les E. Atlas
DATE
2006
IEEE
105views Hardware» more  DATE 2006»
14 years 3 months ago
Optical routing for 3D system-on-package
Abstract— Optical interconnects enable faster signal propagation with virtually no crosstalk. In addition, wavelength division multiplexing allows a single waveguide to be shared...
Jacob R. Minz, Somaskanda Thyagaraja, Sung Kyu Lim