Decimation Theorem (Aliasing Theorem)

GUIDE: Mathematics of the Discrete Fourier Transform (DFT). Decimation Theorem (Aliasing Theorem)

It appears that you are using AdBlocking software. The cost of running this website is covered by advertisements. If you like it please feel free to a small amount of money to secure the future of this website.

<< Previous page  TOC  INDEX  Next page >>

Decimation Theorem (Aliasing Theorem)



Theorem: For all $x\,

\

Proof: Let $k^\ denote the frequency index in the aliased spectrum, and let $Y(k^\. Then $Y$ is length $M=N/L$, where $L$ is the decimation factor. We have

\



Since $M/N=L$, the sum over $l$ becomes

\

using the closed form expression for a geometric series derived earlier. We see that the sum over $L$ effectively samples $x$ every $L$samples. This can be expressed in the previous formula by defining $m\ which ranges only over the nonzero samples:

\



Since the above derivation also works in reverse, the theorem is proved.

Here is an illustration of the Decimation Theorem in Matlab:

>> N=4;
>> x = 1:N;
>> X = fft(x);
>> x2 = x(1:2:N);
>> fft(x2)                         % FFT(Decimate(x,2))

ans =

 4    -2

>> (X(1:N/2) + X(N/2 + 1:N))/2 % (12) Alias(X,2)

ans =

4.0000   -2.0000</pre></p><p>An illustration of aliasing in the frequency domain is shown in

Fig. 8.10.

<< Previous page  TOC  INDEX  Next page >>

 

© 1998-2017 – Nicola Asuni - Tecnick.com - All rights reserved.
about - disclaimer - privacy