Factorial Calculator Solve exercise 12.6 using SystemVerilog instead of VHDL.
Exercise 6 in Chapter 12
Factorial Calculator This exercise concerns the factorial calculator of exercise 11.9.
(a) Solve exercise 11.9 if not done yet.
(b) Implement the resulting FSM using VHDL. Show meaningful simulation results.
Exercise 9 in Chapter 11
Factorial Calculator An algorithm for calculating f = n! ( n ≥ 0, integer) is described in the flowchart of figure 11.20 . Assume that dv (data valid) is asserted during one clock cycle, indicating when the data (n) is ready, so the computation should commence. Because the circuit will take a variable amount of time to compute f (it depends on the value of n), an output called done must be provided, which should remain high while the machine is idle. Draw a state transition diagram for a Moore-type machine that solves this problem.
