Canonical signed digit

In computing canonical-signed-digit (CSD, also known as non-adjacent form) is a unique way of encoding a value in a signed-digit representation (also known as redundant binary representation), which itself is non-unique representation and allows one number to be represented in many ways. Probability of digit being zero is close to 66% (vs. 50% in two's complement encoding) and leads to efficient implementations of add/subtract networks (e.g. multiplication by a constant) in hardwired digital signal processing.

Canonical signed digit

In computing canonical-signed-digit (CSD, also known as non-adjacent form) is a unique way of encoding a value in a signed-digit representation (also known as redundant binary representation), which itself is non-unique representation and allows one number to be represented in many ways. Probability of digit being zero is close to 66% (vs. 50% in two's complement encoding) and leads to efficient implementations of add/subtract networks (e.g. multiplication by a constant) in hardwired digital signal processing.