Parallel computation of the DFT Suppose that we wish to compute an point DFT using di...

Parallel computation of the DFT Suppose that we wish to compute an point DFT using digital signal processors (DSPs). For simplicity we assume that p = v = 2. In this case each DSP carries out all the computations that are necessary to compute DFT points.

(a) Using the radix-2 DIF flow graph, show that to avoid data shuffling, the entire sequence x (n) should be loaded to the memory of each DSP.

(b) Identify and redraw the portion of the flow graph that is executed by the DSP that computes the DFT samples X(2), X(10), X (6), and X (14).

(c) Show that, if we use DSPs, the computation speed-up S is given by