Sciweavers

83 search results - page 3 / 17
» A New Finite-Field Multiplier Using Redundant Representation
Sort
View
DCC
2000
IEEE
13 years 4 months ago
Efficient Arithmetic on Koblitz Curves
It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: ta...
Jerome A. Solinas
KAIS
2008
114views more  KAIS 2008»
13 years 4 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong
APCSAC
2003
IEEE
13 years 10 months ago
Arithmetic Circuits Combining Residue and Signed-Digit Representations
This paper discusses the use of signed-digit representations in the implementation of fast and efficient residue-arithmetic units. Improvements to existing signed-digit modulo adde...
Anders Lindström, Michael Nordseth, Lars Beng...
NIPS
2004
13 years 6 months ago
Sparse Coding of Natural Images Using an Overcomplete Set of Limited Capacity Units
It has been suggested that the primary goal of the sensory system is to represent input in such a way as to reduce the high degree of redundancy. Given a noisy neural representati...
Eizaburo Doi, Michael S. Lewicki
ISMVL
1999
IEEE
133views Hardware» more  ISMVL 1999»
13 years 9 months ago
Ternary Multiplication Circuits Using 4-Input Adder Cells and Carry Look-Ahead
We introduce a new implementation of a ternary adder with four inputs and two outputs. This ternary adder reduces the number of digits in a multiplication compared with a binary m...
Andreas Herrfeld, Siegbert Hentschke