DocumentCode :
2957904
Title :
On efficient techniques for difficult operations in one and two-digit DBNS index calculus
Author :
Muscedere, R. ; Dimitrov, V.S. ; Jullien, G.A. ; Miller, W.C. ; Ahmadi, M.
Author_Institution :
VLSI Res. Group, Windsor Univ., Ont., Canada
Volume :
2
fYear :
2000
fDate :
Oct. 29 2000-Nov. 1 2000
Firstpage :
870
Abstract :
The Double Base Number System (DBNS), using orthogonal bases of 2 and 3, has similar properties to the logarithmic number system (LNS) if an index calculus is used. The DBNS provides more degrees of freedom than the LNS by virtue of both the orthogonal bases and the ability to use multiple digits. As with the LNS, multiplication and division are easy but addition and subtraction are difficult. This paper introduces a technique that uses a map to a DBNS "index sequence domain", removing the need for the relatively large look-up table solution of the LNS.
Keywords :
computational complexity; digital arithmetic; table lookup; DBNS index calculus; double base number system; index sequence domain; logarithmic number system; look-up table solution; orthogonal bases; Arithmetic; Calculus; Digital signal processing; Filters; Table lookup; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signals, Systems and Computers, 2000. Conference Record of the Thirty-Fourth Asilomar Conference on
Conference_Location :
Pacific Grove, CA, USA
ISSN :
1058-6393
Print_ISBN :
0-7803-6514-3
Type :
conf
DOI :
10.1109/ACSSC.2000.910637
Filename :
910637
Link To Document :
بازگشت