Question
What is Discrete Fourier Transform (DFT)? Find DFT of the function:
Answer :
Word Count : 265
____ _________ ______ _____ _________ _____ __________ ___ __________ ______ ________.
____ ________ _____ ____ ____ ______.
_______ ____ ___ ______ _____ _______ ___ __________ __________.
__________ _____ _______ __________ _______ _________ ____ ____ _______ _______ _______ _________.
____ __________ _________ ___ ____ _____ ________.
______ ___ __________ _____ _________ ____ _____ _______.
__________ _____ _________ _________ __________ _________ ________.
____ ____ ________ ________ _________ _________ _______ ____.
_______ _____ _____ _______ _________.
____ __________ ___ ___ _______ ______ _______ ____.
____ ________ _____ _________ ________ ___ ___ ______ ___.
_______ ________ ______ _____ _______ __________ __________ ________.
_____ __________ _______ ______ ____ ____ _________ ____.
______ _____ _________ _____ ________ _____ ____ __________ _____.
____ ________ _____ _____ _____ _____.
____ _____ ________ ___ ____ __________ _______ ___ ___ ____ _______.
____ ______ ___ ____ _____ _______.
___ _________ ____ ___ ____ _________ _________ __________.
_____ ________ ____ ________ _____ __________ ___ ___.
_________ ________ ____ ____ _________ _______ _____ _________ _______ __________.
__________ ___.
Skip in 10
The discrete Fourier transform (DFT) represents a finite-length discrete signal by a finite set of complex exponentials. For a 2-D M×N array f(x,y) with 0≤x≤M−1 and 0≤y≤N−1, its 2-D DFT is $$ F(k,\ell)=\sum_{x=0}^{M-1}\sum_{y=0}^{N-1} f(x,y)\,e^{-j2\pi\left(\frac{kx}{M}+\frac{\ell y}{N}\right)},\qquad k=0,\dots,M-1,\;\ell=0,\dots,N-1. $$ The inverse is $$ f(x,y)=\frac{1}{MN}\sum_{k=0}^{M-1}\sum_{\ell=0}^{N-1} F(k,\ell)\,e^{+j2\pi\left(\frac{kx}{M}+\frac{\ell y}{N}\right)}. $$ Consider $f(x,y)=\sin(2\pi u_0 x+2\pi v_0 y)$. Using $\sin\theta=\frac{1}{2j}\big(e^{j\theta}-e^{-j\theta}\big)$, write $$ f(x,y)=\frac{1}{2j}\left[e^{j2\pi(u_0 x+v_0 y)}-e^{-j2\pi(u_0 x+v_0 y)}\right]. $$ Then $$ F(k,\ell)=\frac{1}{2j}\sum_{x=0}^{M-1}\sum_{y=0}^{N-1}\left[e^{j2\pi(u_0 x+v_0 y)}-e^{-j2\pi(u_0 x+v_0 y)}\right]e^{-j2\pi\left(\frac{kx}{M}+\frac{\ell y}{N}\right)}. $$ Separate the sums: $$ F(k,\ell)=\frac{1}{2j}\left[\sum_{x=0}^{M-1}e^{j2\pi\left(u_0-\frac{k}{M}\right)x}\sum_{y=0}^{N-1}e^{j2\pi\left(v_0-\frac{\ell}{N}\right)y} -\sum_{x=0}^{M-1}e^{-j2\pi\left(u_0+\frac{k}{M}\right)x}\sum_{y=0}^{N-1}e^{-j2\pi\left(v_0+\frac{\ell}{N}\right)y}\right]. $$ Each sum is a finite geometric series. In general they evaluate to Dirichlet kernels, producing “spectral
______ _________ _________ _____ ___ _________.____ _________ ______ _____ _________ _____ __________ ___ __________ ______ ________.
____ ________ _____ ____ ____ ______.
_______ ____ ___ ______ _____ _______ ___ __________ __________.
__________ _____ _______ __________ _______ _________ ____ ____ _______ _______ _______ _________.
____ __________ _________ ___ ____ _____ ________.
______ ___ __________ _____ _________ ____ _____ _______.
__________ _____ _________ _________ __________ _________ ________.
____ ____ ________ ________ _________ _________ _______ ____.
_______ _____ _____ _______ _________.
____ __________ ___ ___ _______ ______ _______ ____.
____ ________ _____ _________ ________ ___ ___ ______ ___.
_______ ________ ______ _____ _______ __________ __________ ________.
_____ __________ _______ ______ ____ ____ _________ ____.
______ _____ _________ _____ ________ _____ ____ __________ _____.
____ ________ _____ _____ _____ _____.
____ _____ ________ ___ ____ __________ _______ ___ ___ ____ _______.
____ ______ ___ ____ _____ _______.
___ _________ ____ ___ ____ _________ _________ __________.
_____ ________ ____ ________ _____ __________ ___ ___.
_________ ________ ____ ____ _________ _______ _____ _________ _______ __________.
__________ ___.
IGNOU ACADEMY
Your IGNOU journey, made easier.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
Continue Reading — It's Free
Sign in with Google to unlock more of this answer.
✓ Free access
✓ Unlock up to 60% of the answer
✓ No payment required
✓ Unlock up to 60% of the answer
✓ No payment required
Quick Google sign-in. No separate registration form.