Efficient realisation of arithmetic algorithms with weighted collection of posibits and negabits
Authors:
- 1 September 2012
- journal article
- Published by Institution of Engineering and Technology (IET) in IET Computers & Digital Techniques
- Vol. 6 (5) , 259-268
Abstract
Most common uses of negatively weighted bits (negabits), normally assuming arithmetic value −1(0) for logical 1(0) state, are as the most significant bit of 2's-complement numbers and negative component in binary signed-digit (BSD) representation. More recently, weighted bit-set (WBS) encoding of generalised digit sets and practice of inverted encoding of negabits (IEN) have allowed for easy handling of any equally weighted mix of negabits and ordinary bits (posibits) via standard arithmetic cells (e.g., half/full adders, compressors, and counters), which are highly optimised for a host of simple and composite figures of merit involving delay, power, and area, and are continually improving due to their wide applicability. In this paper, we aim to promote WBS and IEN as new design concepts for designers of computer arithmetic circuits. We provide a few relevant examples from previously designed logical circuits and redesigns of established circuits such as 2's-complement multipliers and modified booth recoders. Furthermore, we present a modulo-(2n+1) multiplier, where partial products are represented in WBS with IEN. We show that by using standard reduction cells, partial products can be reduced to two. The result is then converted, in constant time, to BSD representation and, via simple addition, to final sum.Keywords
This publication has 20 references indexed in Scilit:
- A Family of High Radix Signed Digit Adders2011
- An improved maximally redundant signed digit adderComputers and Electrical Engineering, 2010
- Unified Approach to the Design of Modulo-(2^n +/- 1) Adders Based on Signed-LSB Representation of Residues2009
- Constant-time addition with hybrid-redundant numbers: Theory and implementationsIntegration, 2008
- Residue Number Systems - Theory and Implementation2007
- Weighted two-valued digit-set encodings: unifying efficient hardware representation schemes for redundant number systemsIEEE Transactions on Circuits and Systems I: Regular Papers, 2005
- Generalized signed-digit number systems: a unifying framework for redundant number representationsIEEE Transactions on Computers, 1990
- On Classes of Positive, Negative, and Imaginary Radix Number SystemsIEEE Transactions on Computers, 1981
- A Two's Complement Parallel Array Multiplication AlgorithmIEEE Transactions on Computers, 1973
- Signed-Digit Numbe Representations for Fast Parallel ArithmeticIEEE Transactions on Electronic Computers, 1961