Greatest Common Divisor The algorithm and a corresponding flowchart for calculating the greatest common divisor (GCD) between two integers a and b are presented in ( dv) pulse, lasting only one clock period, informs when the computations must start. We want to redesign that machine, now without the datapath (so this is a complete GCD calculator). Note that the "load data "block of figure 5.12 is not indispensable here, but then the inputs must remain stable during the whole computations. Because the circuit will take a variable amount of time to compute the GCD (it depends on the input values), an output called done must be provided, which should remain high while the machine is idle. Draw a state transition diagram for an FSM capable of solving this problem.. A data-valid (dv) pulse, lasting only one clock period, informs when the computations must start. We want to redesign that machine, now without the datapath (so this is a complete GCD calculator). Note that the " load data "block of figure 5.12 is not indispensable here, but then the inputs must remain stable during the whole computations. Because the circuit will take a variable amount of time to compute the GCD (it depends on the input values), an output called done must be provided, which should remain high while the machine is idle. Draw a state transition diagram for an FSM capable of solving this problem.
