The gcd equal the initial value follow the statement gcd

Overview:
A single-purpose processor would consist of a Control Unit and a Datapath unit, and it would look like the following:

The objective of this assignment is to use a finite state machine integrated with datapath to calculate the greatest common divisor (GCD) of two numbers. This is the same design and algorithm that we have discussed in class. The GCD algorithm follows the given pseudo code:
tmpX = X;
tmpY = Y;
while (tmpX != tmpY) {
if (tmpX < tmpY)
tmpY = tmpY-tmpX;

else

The Datapath was discussed in class. It shows the use of two different subtractors; one performs (X - Y) and the other performs (Y – X) depending on the outcome of the comparison between X and Y.

The none-optimized truth table of the GCD Controller is given below. This is the same table as that in slide-16 of the Sigle Purpose Processors file discussed in class. Notice the presence of one external input, “go_i”, and two internal (status) inputs from the datapath;

You may refer to the class material for more details.

To Do and submit:

4.One Subtractor Datapath; The original GCD datapath has two separate subtractors. Redesign the datapath using one subtractor. Redraw your datapath showing the modification and all required changes. You may need to define different status signals. Call this design as “OneSubGCD” datapath.

5.For the OneSubGCD; draw an optimized ASMD chart. You must follow the drawing convention that we discussed in class. The chart should show all RTL operations performed in the datapath, and the status of all needed outputs. Consider this as a Mealy Machine. There should be no redundant states.

2.All python source codes and all your original drawings.

3.This is an individual effort
4.Any partial similarity between two students is considered cheating and both will receive a grade of ZERO
5.NO HAND WRITING. Everything should be done electronically by means of software tools.