## With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

No credit card required

Redundant number representations limit the carry propagation to a few bit-positions, which is usually independent of the wordlength W. This carry-propagation-free feature enables fast addition [1]. The algorithm to carry out signed binary digit addition is not unique [5, 12],[15], and therefore its logic implementation can be diverse.

A radix-2 signed-digit number is coded using 2 unsigned binary numbers, 1 positive and 1 negative, as X = X +X . Hence, each signed digit is represented using 2 bits as where and xi ∈ {,0,1} [4],[13]. This section considers radix-2 hybrid and signed-digit additions and subtractions. In a hybrid operation, 1 input operand and the output operand are in redundant signed-digit representation, and the 2nd input operand is a conventional unsigned number. A signed-digit addition can be viewed as a concatenation of one hybrid addition and one hybrid subtraction.