Study of Discrete Fourier Transform (DFT) and its inverse 
The output of a circular convolution performed on two signals x1(n) = {2, 1, 2, 1} and x2(n) = {1, 2, 3, 4} is:
The difference in the number of complex multipliers required for 16-point DFT and 16-point radix-2 FFT is:
The sequence x(n) = {2, 3, 4, 3} is:
The x[n] = {4, 3, 2, 1, 2, 3} signal is: