2-D DISCRETE FOURIER TRANSFORM CALCULATION OF DFT • Both arrays f(m,n) and F(k,l) are periodic (period = M x N) and sampled (X x Y in space, 1/MX x 1/NY in frequency) • In the CFT, if one function has compact support (i.e. it is space- or frequency-limited), the other must have ∞ support • Therefore, aliasing will occur with the DFT ...