On-line multiplication in real and complex base - Computer Arithmetic, 2003. Proceedings. 16th IEEE Symposium on
نویسندگان
چکیده
Multiplication of two numbers represented in base is shown to be computable by an on-line algorithm when is a negative integer, a positive non-integer real number, or a complex number of the form , where is a positive integer.
منابع مشابه
On-Line Multiplication in Real and Complex Base
Multiplication of two numbers represented in base is shown to be computable by an on-line algorithm when is a negative integer, a positive non-integer real number, or a complex number of the form ipr, where r is a positive integer.
متن کاملDecimal Floating-Point: Algorism for Computers
Origins of decimal arithmetic • Decimal (base 10) arithmetic has been used for thousands of years • Algorism (Indo-Arabic place value system) in use since 800 AD • Many early computers were decimal Decimal computation today • Pervasive in financial, commercial, and human-centric applications – often a legal requirement • Benchmarks do not reflect actual use • 55% of numeric data in databases ar...
متن کاملGuest Editors' Introduction: Special Issue on Computer Arithmetic
COMPUTER arithmetic is one of the oldest research topics. Early civilizations used marked bones to memorize numerical values. This approach can be viewed as a combination of read only memories and a unary number system in which addition was very efficient. Around 3300 BC, the first true number systems appeared when Sumerian clay tablets were used to implement a radix-60 number system. A variati...
متن کاملA Less Recursive Variant of Karatsuba-Ofman Algorithm for Multiplying Operands of Size a Power of Two
We propose a new algorithm for fast multiplication of large integers having a precision of 2 computer words, where k is an integer. The algorithm is derived from the Karatsuba-Ofman Algorithm and has the same asymptotic complexity. However, the running time of the new algorithm is slightly better, and it makes one third as many recursive calls.
متن کاملModular Multiplication and Base Extensions in Residue Number Systems
We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery’s method adapted to residue arithmetic. By choosing the moduli of the RNS system reasonably large, an effect corresponding to a redundant high-radix implementation is achieved, due to the carry-free nature of residue arithmetic. The actual computation in the multiplication takes place in co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001