Binary Adder-Subtractor | Digital Circuits - Electronics and Communication Engineering (ECE) PDF Download

About Binary Adder-Subtractor

• A Binary Adder-Subtractor is a special type of circuit that is used to perform both operations, i.e., Addition and Subtraction. The operation which is going to be used depends on the values contained by the control signal. In Arithmetic Logical Unit, it is one of the most important components.
• To work with Binary Adder-Subtractor, it is required that we have knowledge of the XOR gate, Full-Adder, Binary Addition, and subtraction.

For example, we will take two 4-bit binary numbers 'X' and 'Y' for the operation with digits.
The Binary Adder-Subtractor is a combination of 4 Full-Adder, which is able to perform the addition and subtraction of 4-bit binary numbers. The control line determines whether the operation being performed is either subtraction or addition. This determination is done by the binary values 0 and 1, which is hold by K.

• In the above diagram, the control lines of the first Full-Adder is directly coming as its input(input carry C₀). The X₀ is the least significant bit of A, which is directly inputted in the Full-Adder. The result produced by performing the XOR operation of Y₀ and K is the third input of the Binary Adder-Subtractor. The sum/difference(S₀) and carry(C₀) are the two outputs produced from the First Full-adder.
• When the value of K is set to true or 1, the Y0⨁K produce the complement of Y0 as the output. So the operation would be X + Y₀', which is the 2's complement subtraction of X and Y. It means when the value of K is 1; the subtraction operation is performed by the binary Adder-Subtractor.
• In the same way, when the value of K is set to 0, the Y₀⨁K produce Y0 as the output. So the operation would be X + Y₀, which is the binary addition of X and Y. It means when the value of K is 0; the addition operation is performed by the binary Adder-Subtractor.
• The carry/borrow C₀ is treated as the carry/borrow input for the second Full-Adder. The sum/difference S₀ defines the least significant bit of the sum/difference of numbers X and Y. Just like X₀, the X₁, X₂, and X₃ are faded directly to the 2^nd, 3^rd, and 4^th Full-Adder as an input. The outputs after performing the XOR operation of Y₁, Y₂, and Y₃ inputs with K are the third inputs for 2^nd, 3^rd, and 4^th Full-Adder. The carry C₁, C₂ are passed as the input to the Full-Adder. Cout is the output carry of the sum/difference. To form the final result, the S₁, S₂, S₃ are recorded with s₀. We will use n number of Full-Adder to design the n-bit binary Adder-Subtractor.

Example
We assume that we have two 3 bit numbers, i.e., X=100 and Y=011, and feed them in Full-Adder as an input.
X₀ = 0     X₁ = 0     X₂ = 1
Y₀ = 1     Y₁ = 1    & Y₂ = 0
For K=0:
Y₀⨁K=Y₀ and C_in = K = 0
So, from first Full-Adder
S₀ = X₀ + Y₀ + C_in
S₀ =  0 + 1 + 0
S₀ = 1
C₀ = 0

Similarly,
S₁ = X₁ + Y₁ + C0
S₁ = 0 + 1 + 0
S₁=1 and C₁ = 0

Similarly,
S₂ = X₂ + Y₂ + C₁
S₂ = 1 + 0 + 0
S₂ = 1 and C₂ = 0
Thus,
X= 100 =4
Y = 011 = 3
Sum = 0111 = 7
For K=1
Y0⨁K= Y₀' and C_in = k = 1
So,
S₀ = X₀ + Y₀'+ C_i
S₀ = 0 + 0 + 1
S₀ = 1 and C₀ = 0

Similarly,
S₁ = X₁+Y₁'+C₀
S₁ = 0 + 0 + 0
S₁=0 and C₁ = 0

Similarly,
S₂ = X₂ + Y₂ '+ C
S₂ = 1 + 1+0
S₂ = 0 and C₂ = 0
Thus,
X = 010 = 4
Y = 011 = 3
Difference = 001 = 1