Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE) PDF Download

Like continuous time signal Fourier transform, discrete time Fourier Transform can be used to represent a discrete sequence into its equivalent frequency domain representation and LTI discrete time system and develop various computational algorithms.

X (jω) in continuous F.T, is a continuous function of x(n). However, DFT deals with representing x(n) with samples of its spectrum X(ω). Hence, this mathematical tool carries much importance computationally in convenient representation. Both, periodic and non-periodic sequences can be processed through this tool. The periodic sequences need to be sampled by extending the period to infinity.

Frequency Domain Sampling

From the introduction, it is clear that we need to know how to proceed through frequency domain sampling i.e. sampling X(ω). Hence, the relationship between sampled Fourier transform and DFT is established in the following manner.

Similarly, periodic sequences can fit to this tool by extending the period N to infinity.

Let an Non periodic sequence be,  Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

Defining its Fourier transform,

Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)     ...eq(1)

Here, X(ω) is sampled periodically, at every δω radian interval.

As X(ω) is periodic in 2π radians, we require samples only in fundamental range. The samples are taken after equidistant intervals in the frequency range 0≤ω≤2π. Spacing between equivalent intervals isIntroduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE) radian.

Now evaluating, Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)     ...eq(2)

where k=0,1,……N-1

After subdividing the above, and interchanging the order of summation

Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)    ...eq(3)

Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE) periodic function of period N and its fourier series Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

where, n = 0,1,…..,N-1; ‘p’- stands for periodic entity or function

The Fourier coefficients are,

Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)   ...eq(4)

Comparing equations 3 and 4, we get ;  Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)    ...eq(5)Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)    ...eq(6)

From Fourier series expansion,

Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)    ...eq(7)

Where n=0,1,…,N-1

Here, we got the periodic signal from X(ω). x(n) can be extracted from xp(n)only, if there is no aliasing in the time domain. N≥L

N = period of xp(n) L = period of x(n)

Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

The mapping is achieved in this manner.

Properties of DFT

Linearity

It states that the DFT of a combination of signals is equal to the sum of DFT of individual signals. Let us take two signals x1(n) and x2(n), whose DFT s are X1(ω) and X2(ω) respectively. So, if

Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

Then   Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

where a and b are constants.

Symmetry

The symmetry properties of DFT can be derived in a similar way as we derived DTFT symmetry properties. We know that DFT of sequence x(n) is denoted by X(K). Now, if x(n) and X(K) are complex valued sequence, then it can be represented as under

Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

And  Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

Duality Property

Let us consider a signal x(n), whose DFT is given as X(K). Let the finite duration sequence be X(N). Then according to duality theorem,

If, Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

Then, Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

So, by using this theorem if we know DFT, we can easily find the finite duration sequence.

Complex Conjugate Properties

Suppose, there is a signal x(n), whose DFT is also known to us as X(K). Now, if the complex conjugate of the signal is given as x*(n), then we can easily find the DFT without doing much calculation by using the theorem shown below.

If,   Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

Then,  Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

Circular Frequency Shift

The multiplication of the sequence x(n) with the complex exponential sequence ej2Πkn/N is equivalent to the circular shift of the DFT by L units in frequency. This is the dual to the circular time shifting property.

If, Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

Then,  Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

Multiplication of Two Sequence

If there are two signal x1(n) and x2(n) and their respective DFTs are X1(k) and X2(K), then multiplication of signals in time sequence corresponds to circular convolution of their DFTs.

If, Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)
Then,   Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

Parseval’s Theorem

For complex valued sequences x(n) and y(n), in general

If, Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

Then, Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

The document Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE) is a part of the Electronics and Communication Engineering (ECE) Course Signals and Systems.
All you need of Electronics and Communication Engineering (ECE) at this link: Electronics and Communication Engineering (ECE)
32 videos|76 docs|63 tests

Top Courses for Electronics and Communication Engineering (ECE)

FAQs on Introduction - Discrete Fourier Transform - Signals and Systems - Electronics and Communication Engineering (ECE)

1. What is the Discrete Fourier Transform (DFT)?
Ans. The Discrete Fourier Transform (DFT) is a mathematical algorithm that transforms a finite sequence of equally spaced samples of a function into a sequence of complex numbers, representing the frequency components of the original function.
2. How is the Discrete Fourier Transform different from the Fast Fourier Transform (FFT)?
Ans. The Fast Fourier Transform (FFT) is an algorithm used to efficiently compute the Discrete Fourier Transform (DFT). While the DFT requires O(n^2) operations, the FFT reduces this to O(n log n) operations, making it much faster for large data sets.
3. What are the applications of the Discrete Fourier Transform?
Ans. The Discrete Fourier Transform has numerous applications in various fields. It is widely used in signal processing, image processing, audio and video compression, speech recognition, data compression, and solving differential equations, among others.
4. How can the Discrete Fourier Transform be implemented in software?
Ans. The Discrete Fourier Transform can be implemented in software using various programming languages such as Python, MATLAB, or C/C++. There are also libraries available, such as NumPy or SciPy, which provide efficient functions for computing the DFT.
5. Can the Discrete Fourier Transform be used for analyzing non-periodic signals?
Ans. Yes, the Discrete Fourier Transform can be used to analyze non-periodic signals. However, since the DFT assumes periodicity, it may introduce artifacts in the frequency domain for non-periodic signals. To overcome this, techniques such as windowing or zero-padding can be applied before computing the DFT to minimize the artifacts and improve the analysis of non-periodic signals.
32 videos|76 docs|63 tests
Download as PDF
Explore Courses for Electronics and Communication Engineering (ECE) exam

Top Courses for Electronics and Communication Engineering (ECE)

Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev
Related Searches

Semester Notes

,

past year papers

,

Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

,

mock tests for examination

,

study material

,

Extra Questions

,

video lectures

,

practice quizzes

,

pdf

,

Free

,

shortcuts and tricks

,

MCQs

,

Sample Paper

,

Objective type Questions

,

Important questions

,

Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

,

Viva Questions

,

Previous Year Questions with Solutions

,

Summary

,

Introduction - Discrete Fourier Transform | Signals and Systems - Electronics and Communication Engineering (ECE)

,

ppt

,

Exam

;