Sciweavers

35 search results - page 1 / 7
» Constant-time addition with hybrid-redundant numbers: Theory...
Sort
View
INTEGRATION
2008
191views more  INTEGRATION 2008»
13 years 4 months ago
Constant-time addition with hybrid-redundant numbers: Theory and implementations
Abstract: Hybrid-redundant number representation has provided a flexible framework for digitparallel addition in a manner that facilitates area-time tradeoffs for VLSI implementati...
Ghassem Jaberipur, Behrooz Parhami
ARITH
2005
IEEE
13 years 10 months ago
The Residue Logarithmic Number System: Theory and Implementation
— The Residue Logarithmic Number System (RLNS) represents real values as quantized logarithms which, in turn, are represented using the Residue Number System (RNS). Compared to t...
Mark G. Arnold
ASAP
2002
IEEE
170views Hardware» more  ASAP 2002»
13 years 9 months ago
Reviewing 4-to-2 Adders for Multi-Operand Addition
Recently there has been quite a number of papers discussing the use of redundant 4-to-2 adders for the accumulation of partial products in multipliers, claiming one type to be sup...
Peter Kornerup
TC
2011
12 years 11 months ago
Performing Arithmetic Operations on Round-to-Nearest Representations
—During any composite computation, there is a constant need for rounding intermediate results before they can participate in further processing. Recently, a class of number repre...
Peter Kornerup, Jean-Michel Muller, Adrien Panhale...
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
14 years 1 months ago
Fully-Functional Succinct Trees
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
Kunihiko Sadakane, Gonzalo Navarro