Journal Article10.1109/T-C.1973.223671
Arithmetic Algorithms in a Negative Base
29
TL;DR: Algorithms are described for the basic arithmetic operations and square rooting in a negative base and a new operation called polarization that reverses the sign of a number facilitates subtraction, using addition.
read more
Abstract: Algorithms are described for the basic arithmetic operations and square rooting in a negative base. A new operation called polarization that reverses the sign of a number facilitates subtraction, using addition. Some special features of the negative-base arithmetic are also mentioned.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Finite segmentp-adic number systems with applications to exact computation
E. V. Krishnamurthy,T. Mahadeva Rao,K. Subramanian +2 more
- 01 Feb 1975
TL;DR: A fractional weighted number system, based on Hensel’s code, is proposed for constructing a unique code for rational numbers in a certain range, which combines the best features and advantages of both thep-ary and residue number systems.
43
Golden ratio in science, as random sequence source, its computation and beyond
Syamal K. Sen,Ravi P. Agarwal +1 more
TL;DR: This idea of getting random sequences possibly opens up a new efficient way of solving numerous optimization problems including the NP-hard travelling salesman problem by polynomial-time heuristics such as ant system approaches, genetic algorithms, simulated annealing and other randomized algorithms.
40
Parallel optical negabinary signed-digit computing: algorithm and optical implementation
TL;DR: A complete set of negabinary arithmetic operations are presented, including the basic addition/subtraction logic, the two-step carry-free addition/ Subtraction algorithm based onnegabinary signed-digit (NSD) representation, parallel multiplication, and the fast conversion from NSD to the normalNegabinary in the carry-look-ahead mode.
35
Negative base encoding in optical linear algebra processors
TL;DR: In the digital multiplication by analog convolution algorithm, the bits of two encoded numbers are convolved to form the product of the two numbers in mixed binary representation; this output can be easily converted to binary.
30
Arithmetic Algorithms in a Negative Base
TL;DR: Algorithms are described for the basic arithmetic operations in a negative base that are simpler, faster, and more general than those proposed by Sankar et al.
17
References
Negative Radix Conversion
TL;DR: Adoption of a negative radix for number representation results in a system that is totally indifferent to the sign of the number, compared to theSign-magnitude representation, which requires one extra digit.
41