✦ LIBER ✦

A Parallel Structure for Signed-Number Multiplication and Addition

✍ Scribed by De Mori, R.; Serra, A.

Book ID: 114587965
Publisher: IEEE
Year: 1972
Tongue: English
Weight: 264 KB
Volume: C-21
Category: Article
ISSN: 0018-9340
DOI: 10.1109/t-c.1972.223525

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel quaternary signed-digit arithme

Parallel quaternary signed-digit arithmetic operations: addition, subtraction, multiplication and division

✍ Mahmoud K Habib; Abdallah K Cherri 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 245 KB

A quaternary signed-digit number representations-based arithmetic unit is proposed. The arithmetic unit performs parallel one-step addition (subtraction), multiplication and division. We use the symbolic substitution technique to reduce the number of the computation rules involved in the computation

Algorithm and implementation of parallel

Algorithm and implementation of parallel multiplication in a mixed number system

✍ Yinfang Luo 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 433 KB

Parallel algorithms for addition and mul

Parallel algorithms for addition and multiplication on processor arrays with reconfigurable bus systems

✍ P. Thangavel; V.P. Muthuswamy 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 426 KB

New coding scheme for addition and subtr

New coding scheme for addition and subtraction using the modified signed-digit number representation in optical computation

✍ Mukhopadhyay, S. ;Basuray, A. ;Datta, A. K. 📂 Article 📅 1988 🏛 The Optical Society 🌐 English ⚖ 553 KB

Differential Neural Networks for Multipl

Differential Neural Networks for Multiplication and Addition: A DCM Analysis

✍ C.H. Chen; L. Wang; X. Zhou; Q. Dong; Y. Li; C. Chen 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 125 KB

Structure Theorem for Multiple Addition

Structure Theorem for Multiple Addition and the Frobenius Problem

✍ Vsevolod F. Lev 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 304 KB

Let A [0; l] be a set of n integers, and let h 2. By how much does |hA| exceed |(h&1) A| ? How can one estimate |hA| in terms of n, l ? We give sharp lower bounds extending and generalizing the well-known theorem of Freiman for |2A|. A number of applications are provided as well. In particular, we g