Explain about 4-bit adder-subtractor circuit, Computer Engineering

Assignment Help:

Q. Explain about 4-bit adder-subtractor circuit?

Subtraction operation on binary numbers can be obtained by succession of addition operations only it implies that to achieve subtraction A-B we can find 2's complement of B. This can be computed by 1's complemented and then adding 1 to it. So a common circuit can carry out addition and subtraction operation. A 4-bit adder subtraction circuit is displayed in figure below that is formed by employing XOR gate with each full adder. XOR gate with output 0 is for inspecting overflow.

2153_Explain about 4-bit adder-subtractor circuit.png

Figure: 4-bit adder-subtractor circuit

Control input 'x' controls operations it implies that if x =0 then circuit acts as an adder and if x =1 then circuit acts as a subtractor. The operation is summarized as below:

a. When x = 0, c = 0, output of all XOR gates would be same as corresponding input Bi where i = 0 to 3. So Ai and Bi are added by full adders providing Sum Si and carry Ci .

b. When x = 1 output of all XOR gates will be complement of input Bi where i =0 to 3 to that carry C0=1 is added. So circuit finds A plus 2's complement of B which is equal to A-B.


Related Discussions:- Explain about 4-bit adder-subtractor circuit

Computer Graphics , What do you mean by ‘Bresenham’s him Algorithm?

What do you mean by ‘Bresenham’s him Algorithm?

Explain virtual memory, In a memory hierarchy system, data and programs are...

In a memory hierarchy system, data and programs are first stored in secondary or auxiliary memory. Program and its related data are brought in main memory for execution. What if th

What is boundary scan, What is Boundary Scan?  Boundary scan is a board...

What is Boundary Scan?  Boundary scan is a board level design method that provides test access to the input and output pads of ICs on PCBs. Boundary scan changes the IO circuit

Dhcp, how to set up dhcp

how to set up dhcp

What is reducibility, What is reducibility?  The primary method of prov...

What is reducibility?  The primary method of proving some problems are computationally unsolvable.       It is known as reducibility. Reducibility always includes two problems

What are the parts of a deployment diagram, ? Nodes: A node shows any hardw...

? Nodes: A node shows any hardware component. The configuration of hardware is shown by attributes of nodes. ? Components: A component shows software. Every component straight

Explain fixed point representation, Q. Explain Fixed Point Representation? ...

Q. Explain Fixed Point Representation? The fixed-point numbers in binary has a sign bit. A positive number has a sign bit 0 whereas negative number has a sign bit 1. In fixed-p

Turning machine, procedure of turning machine operation on markov algorithm...

procedure of turning machine operation on markov algorithm

Advanced microprocessor, Write a program to mask bits D3D2D1D0 and to set ...

Write a program to mask bits D3D2D1D0 and to set bits D5D4 and to invert bits D7D6 of the AX register.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd