𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Faster Integer Multiplication

✍ Scribed by Fürer, Martin

Book ID
111868834
Publisher
Society for Industrial and Applied Mathematics
Year
2009
Tongue
English
Weight
319 KB
Volume
39
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast on-line integer multiplication
Fast on-line integer multiplication
✍ Michael J. Fischer; Larry J. Stockmeyer 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 688 KB

A Turing machine multiplies binary integers on-line if it receives its inputs, low-order digit first, and produces the jth digit of the product before reading in the (j+l)st digits of the two inputs. We present a general method for converting any off-line mukiplication algorithm which forms the prod

A practical algorithm for faster matrix
A practical algorithm for faster matrix multiplication
✍ Igor Kaporin 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 69 KB

The purpose of this paper is to present an algorithm for matrix multiplication based on a formula discovered by Pan [7]. For matrices of order up to 10 000, the nearly optimum tuning of the algorithm results in a rather clear non-recursive one-or two-level structure with the operation count comparab

An efficient algorithm for parallel inte
An efficient algorithm for parallel integer multiplication
✍ Benjamin Singer; George Saon 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 67 KB

In this paper we propose an efficient algorithm to implement parallel integer multiplication by a combination of parallel additions, shifts and reads from a memoryresident lookup table dedicated to squares. Such an operator called PIM (parallel integer multiplication) is in fact microprogrammed at t