In the following flow graph that implements 8-point fast Fourier transform (FFT): a) Highlight the lines...
In the following flow graph that implements 8-point fast Fourier transform (FFT): a) Highlight the lines (by marking the associated lines in red or think black) that need to compute multiplications (excluding multiplications with 1 and -1). What is the number of required complex multiplications? b) What is the number of require complex multiplications when performing a 16-point FFT? x[0] X[0] x[4] Wind x1200 + X[2] *[6] W LILIA wi WN