✦ LIBER ✦

Fast one's-complement multiplication

✍ Scribed by Amos Omondi

Book ID: 107765977
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 742 KB
Volume: 39
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90158-e

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bit-level two's complement matrix multip

Bit-level two's complement matrix multiplication

✍ Radhika S. Grover; Weijia Shang; Qiang Li 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 282 KB

We present a novel design of a bit-level matrix multiplier in which individual bits of a word do not have to be processed as a unit. In bit-level architectures the carry propagation delay is eliminated from the critical path. For example, in matrix multiplication, the carry chain of calculating the

Performance of One's Complement Caches

✍ Qing Yang; Sridar Adina; T. Sun 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 287 KB

Fast matrix multiplication

✍ Carlos F. Bunge; Gerardo Cisneros 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 358 KB

Several implementations of matrix multiplication (MMUL) in Fortran and VAX assembly language are discussed. On a VAX-11/780 computer, the most efficient MMUL is achieved through vector-scalarmultiply-and-add (VSMA) operations, rather than by means of dot products. We also discuss optimal MMUL algori

Fast Fact Multiplication

✍ Blanche Roesser 📂 Fiction 📅 2018 🏛 Gareth Stevens Publishing LLLP 🌐 English ⚖ 5 MB

To truly master multiplication, it's necessary to be able to visualize what's happening when we multiply two numbers, not just memorize multiplication facts. This book encourages higher-order thinking and provides readers with an understanding of the properties of multiplication, including the commu

Fast sparse matrix multiplication

✍ S.C. Park; J.P. Draayer; S.-Q. Zheng 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 834 KB

A new space-efficient representation for sparse matrices is introduced and a fast sparse matrix multiplication algorithm based on the new representation is presented. The scheme is very efficient when the nonzero elements of a sparse matrix are partially or fully adjacent to one another as in band o

Fast matrix multiplication is stable

✍ James Demmel; Ioana Dumitriu; Olga Holtz; Robert Kleinberg 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 358 KB