Multiplication by a constant is sublinear

Proceedings - Symposium on Computer Arithmetic

Volumn , Issue , 2007, Pages 261-268

  Dimitrov, Vassil ^a   Imbert, Laurent ^a,b   Zakaluzny, Andrew ^a  

^a UNIVERSITY OF CALGARY   (Canada)

^b LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; INTEGER PROGRAMMING; NUMBER THEORY; NUMERICAL METHODS;

DOUBLE BASE NUMBER SYSTEM (DBNS); MULTIPLICATION; NUMERICAL DATA SHOWCASING; SUBLINEAR WAY;

DIGITAL ARITHMETIC;

EID: 36048934727     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ARITH.2007.24     Document Type: Conference Paper

References (15)

1. A. D. Booth, "A signed binary multiplication technique," Quarterly Journal of Mechanics and Applied Mathematics, vol. 4, no. 2, pp. 236-240, 1951,
2. reprinted in E. E. Swartzlander, Computer Arithmetic, Vol. 1, IEEE Computer Society Press Tutorial, Los Alamitos, CA, 1990.
3. R. Bernstein, "Multiplication by integer constants," Software - Practice and Experience, vol. 16, no. 7, pp. 641-652, Jul 1986.
4. V. Lefèvre, "Multiplication by an integer constant," INRIA, Research Report 4192, May 2001.
5. N. Boullis and A. Tisserand, "Some optimizations of hardware multiplication by constant matrices," IEEE Transactions on Computers, vol. 54, no. 10, pp. 1271-1282, Oct. 2005.
6. V. S. Dimitrov, G. A. Jullien, and W. C. Miller, "Theory and applications of the double-base number system," IEEE Transactions on Computers, vol. 48, no. 10, pp. 1098-1106, Oct. 1999.
7. V. Dimitrov, L. Imbert, and P. K. Mishra, "Efficient and secure elliptic curve point multiplication using double-base chains," in Advances in Cryptology, ASIACRYPT'05, ser. Lecture Notes in Computer Science, vol. 3788. Springer, 2005, pp. 59-78.
8. G. W. Reitwiesner, "Binary arithmetic," Advances in Computers, vol. 1, pp. 231-308, 1960.
9. R. I. Hartley, "Subexpression sharing in filters using canonic signed digit multipliers," IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, vol. 43, no. 10, pp. 677-688, Oct. 1996.
10. "GCC, the GNU compiler collection," http://www.gnu.org.
11. A. G. Dempster and M. D. Macleod, "Constant integer multiplication using minimum adders," IEE Proc. Circuits Devices Syst., vol. 141, no. 5, pp. 407-413, 1994.
12. V. S. Dimitrov, G. A. Jullien, and W. C. Miller, "An algorithm for modular exponentiation," Information Processing Letters, vol. 66, no. 3, pp. 155-159, May 1998.
13. R. Tijdeman, "On the maximal distance between integers composed of small primes," Compositio Mathematica, vol. 28, pp. 159-162, 1974.
14. V. Berthe and L. Imbert, "On converting numbers to the double-base number system," in Advanced Signal Processing Algorithms, Architecture and Implementations XIV, ser. Proceedings of SPIE, vol. 5559. SPIE, 2004, pp. 70-78.
15. C. Doche and L. Imbert, "Extended double-base number system with applications to elliptic curve cryptography," in Progress in Cryptology, INDOCRYPT'06, ser. Lecture Notes in Computer Science, vol. 4329. Springer, 2006, pp. 335-348.