Question

A discrete-time signal is given as: x(n) = {1,2,2,-3).
(a) Compute (x(4 – n)),
(b) Compute DFT of the signal found in part (a), i.e. (x(2-n)),
(c) Find the no. of complex adders and complex multipliers required
for computation of part (b).
(d) If FFT approach is used for part (b), then how many complex multipliers and adders would be
required?
(e) Let's consider another signal, h(n) = {1,2,3,4} which is the impulse response of a LTI system
where the given signal above, x(n) is the input to the systein. Find the output of the system
utilizing circular convolution.
(1) Based on part (e) and DFT property, prove that circular convolution in time domain is equivalent
to multiplication in DFT domain. ie. DFT[x,(n) = x2(n)) = x2(k)X2(k) where * denotes
circular convolution​

Answer 1

Answer:

B

Step-by-step explanation:

JLKC NC,. MVMDFLJ ;FVM .LDF  ∧ω↓⇄⇄⊇∀∀