Sciweavers

Share
INTEGRATION
2008

Constant-time addition with hybrid-redundant numbers: Theory and implementations

12 years 1 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 implementations via arbitrary spacing of redundant digit positions within an otherwise nonredundant representation. We revisit the hybrid redundancy scheme, pointing out limitations such as representational asymmetry, lack of representational closure in certain adder implementations, and difficulties in subtraction and carry acceleration. Given the intuitiveness of the hybrid redundancy concept and its potential for describing practically useful redundant number systems, we are motivated to extend it within the framework of weighted bit-set encodings to circumvent the aforementioned problems. The extension is based mainly on allowing negatively weighted bits (negabits), as well as standard posibits, to appear in nonredundant positions. Our extended hybrid redundancy scheme provides for arbitrary spacing of redundant posi...
Ghassem Jaberipur, Behrooz Parhami
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2008
Where INTEGRATION
Authors Ghassem Jaberipur, Behrooz Parhami
Comments (0)
books