1
$\begingroup$

I have this MATLAB code:

w = [1 2 3 2 1];
W=fft(w);
V=sqrt(W);
v=ifft(V);

And I need to explain how to get to $v[n]$ without using the direct formula for DFT - I need to use the properties of DFT.

I've tried solving the problem using circular shift and circular convolution but I can't seem to understand the result.

According to MATLAB, $v[n]=\textrm{[1 1 1 0 0]}$.

$\endgroup$
2
  • $\begingroup$ Is this home work ? $\endgroup$
    – Hilmar
    Jan 1 '17 at 23:53
  • $\begingroup$ No, I'm studying for an exam and this is the only exercise I can't solve $\endgroup$
    – Paulo Maia
    Jan 2 '17 at 0:03
3
$\begingroup$

Since $V(\omega)V(\omega)=W(\omega)$, in the time domain we expect $v[n]*v[n]=w[n]$. That is, the convolution of $v[n]$ with itself should become $w[n]$.

$w[n]$ is in the form of a triangular signal. A triangular signal of odd length $N$ can be constructed by convolving a half-rectangular signal of length $(N+1)/2$ with itself. So $v[n]$ is a rectangular pulse with $3$ elements equal to one and the remaining $2$ elements equal to zero.

$\endgroup$
1
  • 1
    $\begingroup$ Oh, got it! I was looking at it the wrong way - it's really easy if you consider W[k]=V[k]*V[k]. Thanks for the help :) $\endgroup$
    – Paulo Maia
    Jan 2 '17 at 0:09

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.