Redundant binary representation

<p>A redundant binary representation (RBR) is a <a href="/facts/Numeral_system/1KKlG4nd">numeral system</a> that uses more bits than needed to represent a single binary <a href="/facts/Numerical_digit/JJdLBoGT">digit</a> so that most numbers have several representations. An RBR is unlike usual <a href="/facts/Binary_numeral_system/a6JDSRPs">binary numeral systems</a>, including <a href="/facts/Two%2527s_complement/xhjYpnsc">two's complement</a>, which use a single bit for each digit. Many of an RBR's properties differ from those of regular binary representation systems. Most importantly, an RBR allows addition without using a typical carry. When compared to non-redundant representation, an RBR makes <a href="/facts/Bitwise_operation/0gkqnUda">bitwise logical operation</a> slower, but <a href="/facts/Arithmetic_operation/hvHwkbMV">arithmetic operations</a> are faster when a greater bit width is used. Usually, each digit has its own sign that is not necessarily the same as the sign of the number represented. When digits have signs, that RBR is also a <a href="/facts/Signed-digit_representation/EKavtVJB">signed-digit representation</a>.
</p>

Redundant binary representation open-in-new

Redundant binary representation