Scribd
Upload
43 views3 pages

DFT

Uploaded by

avrajit tech hd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
43 views3 pages

DFT

Uploaded by

avrajit tech hd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

The Discrete Fourier Transform (DFT) is a crucial concept in digital signal processing, providing a way

to analyze the frequency content of discrete-time signals. Let's derive the DFT, understand its
properties, and look at its applications.

### Definition of DFT

The DFT converts a finite sequence of \( N \) complex numbers \( x[n] \) into another sequence of \
( N \) complex numbers \( X[k] \). The DFT of a sequence \( x[n] \) is defined as:

\[ X[k] = \sum_{n=0}^{N-1} x[n] e^{-i \frac{2\pi}{N} kn} \]

for \( k = 0, 1, 2, \ldots, N-1 \).

### Inverse DFT

To recover the original sequence \( x[n] \) from its DFT \( X[k] \), we use the inverse DFT:

\[ x[n] = \frac{1}{N} \sum_{k=0}^{N-1} X[k] e^{i \frac{2\pi}{N} kn} \]

### Properties of DFT

1. **Linearity**:

If \( x_1[n] \) and \( x_2[n] \) have DFTs \( X_1[k] \) and \( X_2[k] \) respectively, then for any
constants \( a \) and \( b \):

\[ a x_1[n] + b x_2[n] \leftrightarrow a X_1[k] + b X_2[k] \]

2. **Periodicity**:

The DFT \( X[k] \) is periodic with period \( N \):

\[ X[k + N] = X[k] \]

3. **Time Shifting**:

If \( x[n] \leftrightarrow X[k] \), then:


\[ x[(n-n_0) \mod N] \leftrightarrow X[k] e^{-i \frac{2\pi}{N} kn_0} \]

4. **Frequency Shifting**:

If \( x[n] \leftrightarrow X[k] \), then:

\[ x[n] e^{i \frac{2\pi}{N} n k_0} \leftrightarrow X[(k - k_0) \mod N] \]

5. **Convolution**:

The circular convolution of two sequences \( x[n] \) and \( h[n] \) in the time domain corresponds
to multiplication in the frequency domain:

\[ (x \circ h)[n] \leftrightarrow X[k] \cdot H[k] \]

### Examples

1. **DFT of a Simple Sequence**:

Consider a simple sequence \( x[n] = \{1, 2, 3, 4\} \) with \( N = 4 \).

The DFT is calculated as:

\[ X[k] = \sum_{n=0}^{3} x[n] e^{-i \frac{2\pi}{4} kn} \]

- For \( k = 0 \):

\[ X[0] = 1 + 2 + 3 + 4 = 10 \]

- For \( k = 1 \):

\[ X[1] = 1 + 2 e^{-i \pi/2} + 3 e^{-i \pi} + 4 e^{-i 3\pi/2} = 1 - 2i - 3 + 4i = -2 + 2i \]

- For \( k = 2 \):

\[ X[2] = 1 + 2 e^{-i \pi} + 3 e^{-i 2\pi} + 4 e^{-i 3\pi} = 1 - 2 + 3 - 4 = -2 \]

- For \( k = 3 \):

\[ X[3] = 1 + 2 e^{-i 3\pi/2} + 3 e^{-i 3\pi} + 4 e^{-i 9\pi/2} = 1 + 2i - 3 - 4i = -2 - 2i \]

2. **DFT of a Sinusoidal Sequence**:

Consider \( x[n] = \cos\left(\frac{2\pi n}{N}\right) \) for \( N = 4 \).

Using Euler's formula, \( \cos(\theta) = \frac{e^{i\theta} + e^{-i\theta}}{2} \):


\[ x[n] = \frac{1}{2} \left( e^{i \frac{2\pi n}{N}} + e^{-i \frac{2\pi n}{N}} \right) \]

The DFT will show peaks at \( k = 1 \) and \( k = N-1 \), corresponding to the positive and negative
frequencies of the sinusoid.

### Practical Applications

1. **Spectral Analysis**:

The DFT is widely used to analyze the frequency content of signals in various fields, including audio
processing, telecommunications, and image processing.

2. **Filter Design**:

Digital filters can be designed and implemented using the DFT to manipulate specific frequency
components of a signal.

3. **Fast Fourier Transform (FFT)**:

The FFT is an efficient algorithm to compute the DFT, significantly reducing the computational
complexity from \( O(N^2) \) to \( O(N \log N) \). This makes the DFT practical for real-time
applications.

### Conclusion

The Discrete Fourier Transform (DFT) is a fundamental tool in digital signal processing that transforms
a finite sequence of samples into its frequency components. Its properties and applications make it
indispensable for analyzing and processing discrete-time signals. The efficient computation of the
DFT using the FFT has further expanded its utility in various practical applications.

You might also like