A SIGNED BINARY MULTIPLICATION TECHNIQUE
From MaRDI portal
Publication:5805321
DOI10.1093/qjmam/4.2.236zbMath0043.12902OpenAlexW2026445983MaRDI QIDQ5805321
Publication date: 1951
Published in: The Quarterly Journal of Mechanics and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/qjmam/4.2.236
Related Items
Dynamical directions in numeration, A class of systolic multiplier units for VLSI technology, Elliptic curve scalar multiplication algorithm using complementary recoding, High-radix and bit recoding techniques for modular exponentiation, Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography, Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form, Multiplicative circulant networks. Topological properties and communication algorithms, Redundant integer representations and fast exponentiation, Distribution results for low-weight binary representations for pairs of integers, New Self-Checking Booth Multipliers, Circuit level realization of low latency radix-4 Booth scheme for parallel multipliers, Horizontal collision correlation attack on elliptic curves, Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial, The QC-2 parallel queue processor architecture, A delay efficient Vedic multiplier, ON THE BINARY DIGITS OF ALGEBRAIC NUMBERS, Binary signed-digit integers and the Stern diatomic sequence, Method for designing efficient mixed radix multipliers, Adaptive \(m\)-ary segmentation and canonical recoding algorithms for multiplication of large binary numbers, Compact SD: a new encoding algorithm and its application in multiplication, New methods for binary multiplication, Fast simultaneous scalar multiplication, Minimal weight expansions in Pisot bases, Unbalanced digit sets and the closest choice strategy for minimal weight integer representations, An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation, Fast exponentiation by folding the signed-digit exponent in half, Implementation of digital controllers. A survey, Signed bits and fast exponentiation, Matching for random systems with an application to minimal weight expansions, The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography, Minimal expansions in redundant number systems: Fibonacci bases and greedy algorithms
