Determine the computational burden of the algorithm given by (8.2.12) and compare it with the computational burden required in the 2N -point DFT of g (n) . Assume that the FFT algorithm is a radix-2 algorithm.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.