Non-adjacent form, the Glossary

Table of Contents

1. 11 relations: Binary number, Bit, Booth's multiplication algorithm, Cryptography, Digital signal processing, Exponentiation, Exponentiation by squaring, Fibonacci coding, Hamming weight, Integer, Signed-digit representation.

2. Non-standard positional numeral systems

Binary number

A binary number is a number expressed in the base-2 numeral system or binary numeral system, a method for representing numbers that uses only two symbols for the natural numbers: typically "0" (zero) and "1" (one).

See Non-adjacent form and Binary number

Bit

The bit is the most basic unit of information in computing and digital communication.

See Non-adjacent form and Bit

Booth's multiplication algorithm

Booth's multiplication algorithm is a multiplication algorithm that multiplies two signed binary numbers in two's complement notation.

See Non-adjacent form and Booth's multiplication algorithm

Cryptography

Cryptography, or cryptology (from κρυπτός|translit.

See Non-adjacent form and Cryptography

Digital signal processing

Digital signal processing (DSP) is the use of digital processing, such as by computers or more specialized digital signal processors, to perform a wide variety of signal processing operations.

See Non-adjacent form and Digital signal processing

Exponentiation

In mathematics, exponentiation is an operation involving two numbers: the base and the exponent or power.

See Non-adjacent form and Exponentiation

Exponentiation by squaring

In mathematics and computer programming, exponentiating by squaring is a general method for fast computation of large positive integer powers of a number, or more generally of an element of a semigroup, like a polynomial or a square matrix.

See Non-adjacent form and Exponentiation by squaring

Fibonacci coding

In mathematics and computing, Fibonacci coding is a universal code which encodes positive integers into binary code words. Non-adjacent form and Fibonacci coding are non-standard positional numeral systems.

See Non-adjacent form and Fibonacci coding

Hamming weight

The Hamming weight of a string is the number of symbols that are different from the zero-symbol of the alphabet used.

See Non-adjacent form and Hamming weight

Integer

An integer is the number zero (0), a positive natural number (1, 2, 3,...), or the negation of a positive natural number (−1, −2, −3,...). The negations or additive inverses of the positive natural numbers are referred to as negative integers.

See Non-adjacent form and Integer

Signed-digit representation

In mathematical notation for numbers, a signed-digit representation is a positional numeral system with a set of signed digits used to encode the integers. Non-adjacent form and signed-digit representation are non-standard positional numeral systems.

See Non-adjacent form and Signed-digit representation

See also

Non-standard positional numeral systems

• Aiken code
• Asymmetric numeral systems
• Babylonian cuneiform numerals
• Balanced ternary
• Bijective numeration
• Binary-coded decimal
• Complex-base system
• Factorial number system
• Fibonacci coding
• Generalized balanced ternary
• Golden ratio base
• Gray code
• Komornik–Loreti constant
• Mixed radix
• Negafibonacci coding
• Negative base
• Non-adjacent form
• Non-integer base of numeration
• Non-standard positional numeral systems
• Ostrowski numeration
• Quater-imaginary base
• Redundant binary representation
• Signed-digit representation
• Skew binary number system

References

[1] https://en.wikipedia.org/wiki/Non-adjacent_form

Also known as Canonical signed digit.