© The Institution of Engineering and Technology
A scheme is proposed for representing 2's-complement binary numbers in which there are two least-significant bits (LSBs). Benefits of the extra LSB include making the number representation range symmetric (i.e. from −2k−1 to 2k−1 for k-bit integers), allowing sign change by simple bitwise logical inversion, facilitating multiprecision arithmetic and enabling the truncation of results in lieu of rounding. These advantages justify the added storage and interconnect costs stemming from the extra bit. Operation latencies show little or no change relative to conventional 2's-complement arithmetic, thus making double-LSB representation attractive.
References
-
-
1)
-
B. Parhami
.
Generalized signed-digit number systems: a unifying framework for redundant number representations.
IEEE Trans. Comput.
,
1 ,
89 -
98
-
2)
-
D.S. Phatak ,
I. Koren
.
Hybrid signed-digit number systems: a unified framework for redundant number representations with bounded carry propagation chains.
IEEE Trans. Comput.
,
880 -
891
-
3)
-
L.M. Leibowitz
.
A simplified binary arithmetic for the Fermat number transform.
IEEE Trans. Acoust. Speech Signal Process.
,
356 -
359
-
4)
-
Parhami, B., Johansson, S.: `A number representation scheme with carry-free rounding for floating-point signal processing applications', Proc. Int. Conf. Signal and Image Processing, 1998, p. 90–92.
-
5)
-
G. Jaberipur
.
A one-step modulo 2n+1 adder based on double-LSB representation of residues.
CSI J. Comput. Sci. Eng.
-
6)
-
D. Ferrari
.
A division method using a parallel multiplier.
IEEE Trans. Comput.
,
224 -
226
-
7)
-
Parhami, B.: `On producing exactly rounded results in digit–serial on-line arithmetic', Proc. 34th Asilomar Conf. Signals, Systems, and Computers, 2000, p. 889–893.
-
8)
-
M.J. Flynn
.
On division by functional iteration.
IEEE Trans. Comput.
,
702 -
706
-
9)
-
B. Parhami
.
(2000)
Computer arithmetic: algorithms and hardware designs.
-
10)
-
Ercegovac, M.D., Lang, T.: `On-line arithmetic: a design methodology and applications', Proc. IEEE Workshop on VLSI Signal Processing, 1988, p. 252–263.
-
11)
-
C.R. Baugh ,
B.A. Wooley
.
A two's complement parallel array multiplication algorithm.
IEEE Trans. Comput.
,
1045 -
1047
-
12)
-
D.S. Phatak ,
I. Koren
.
Constant-time addition and simultaneous format conversion based on redundant binary representations.
IEEE Trans. Comput.
,
11 ,
1267 -
1278
-
13)
-
A. Omondi ,
B. Premkumar
.
(2007)
Residue number systems: theory and implementation.
-
14)
-
Jaberipur, G., Parhami, B., Ghodsi, M.: `A class of stored-transfer representations for redundant number systems', Proc. 35th Asilomar Conf. Signals, Systems, and Computers, 2001, p. 1304–1308.
-
15)
-
B. Cao ,
C.-H. Chang ,
T. Srikanthan
.
A residue-to-binary converter for a new five-moduli set.
IEEE Trans. Circuits Syst. I
,
1041 -
1049
-
16)
-
G. Jaberipur ,
B. Parhami
.
Stored-transfer representations with weighted digit-set encodings for ultrahigh-speed arithmetic.
IET Circuits Devices Syst.
,
102 -
110
-
17)
-
Dadda, L.: `Fast multipliers for two's complement numbers in serial form', Proc. 7th IEEE Symp. Computer Arithmetic, 1985, p. 57–63.
-
18)
-
J.N. Coleman ,
E.I. Chester ,
C.I. Softley ,
J. Kadlec
.
Arithmetic on the European logarithmic microprocessor.
IEEE Trans. Comput.
,
7 ,
702 -
715
-
19)
-
A. Avizienis
.
Signed-digit number representation for fast parallel arithmetic.
IRE Trans. Electron. Comput.
,
389 -
400
-
20)
-
M.D. Ercegovac ,
T. Lang
.
(1994)
Division and square root: digit-recurrence algorithms and implementations.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cds_20070235
Related content
content/journals/10.1049/iet-cds_20070235
pub_keyword,iet_inspecKeyword,pub_concept
6
6