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

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

Document Description: Introduction - Discrete Fourier Transform for Electronics and Communication Engineering (ECE) 2022 is part of Signals and Systems preparation. The notes and questions for Introduction - Discrete Fourier Transform have been prepared according to the Electronics and Communication Engineering (ECE) exam syllabus. Information about Introduction - Discrete Fourier Transform covers topics like and Introduction - Discrete Fourier Transform Example, for Electronics and Communication Engineering (ECE) 2022 Exam. Find important definitions, questions, notes, meanings, examples, exercises and tests below for Introduction - Discrete Fourier Transform.

Introduction of Introduction - Discrete Fourier Transform in English is available as part of our Signals and Systems for Electronics and Communication Engineering (ECE) & Introduction - Discrete Fourier Transform in Hindi for Signals and Systems course. Download more important topics related with notes, lectures and mock test series for Electronics and Communication Engineering (ECE) Exam by signing up for free. Electronics and Communication Engineering (ECE): Introduction - Discrete Fourier Transform Notes | Study Signals and Systems - Electronics and Communication Engineering (ECE)
1 Crore+ students have signed up on EduRev. Have you?

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 Notes | Study Signals and Systems - Electronics and Communication Engineering (ECE)

Defining its Fourier transform,

Introduction - Discrete Fourier Transform Notes | Study 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 Notes | Study Signals and Systems - Electronics and Communication Engineering (ECE) radian.

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

Introduction - Discrete Fourier Transform Notes | Study 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 Notes | Study Signals and Systems - Electronics and Communication Engineering (ECE)    ...eq(3)

Introduction - Discrete Fourier Transform Notes | Study Signals and Systems - Electronics and Communication Engineering (ECE) periodic function of period N and its fourier series Introduction - Discrete Fourier Transform Notes | Study 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 Notes | Study Signals and Systems - Electronics and Communication Engineering (ECE)   ...eq(4)

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

From Fourier series expansion,

Introduction - Discrete Fourier Transform Notes | Study 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 Notes | Study 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 Notes | Study Signals and Systems - Electronics and Communication Engineering (ECE)

Then   Introduction - Discrete Fourier Transform Notes | Study 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 Notes | Study Signals and Systems - Electronics and Communication Engineering (ECE)

And  Introduction - Discrete Fourier Transform Notes | Study 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 Notes | Study Signals and Systems - Electronics and Communication Engineering (ECE)

Then, Introduction - Discrete Fourier Transform Notes | Study 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 Notes | Study Signals and Systems - Electronics and Communication Engineering (ECE)

Then,  Introduction - Discrete Fourier Transform Notes | Study 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 Notes | Study Signals and Systems - Electronics and Communication Engineering (ECE)

Then,  Introduction - Discrete Fourier Transform Notes | Study 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 Notes | Study Signals and Systems - Electronics and Communication Engineering (ECE)
Then,   Introduction - Discrete Fourier Transform Notes | Study 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 Notes | Study Signals and Systems - Electronics and Communication Engineering (ECE)

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

The document Introduction - Discrete Fourier Transform Notes | Study 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)

Related Searches

MCQs

,

Exam

,

study material

,

practice quizzes

,

Objective type Questions

,

Sample Paper

,

Extra Questions

,

pdf

,

mock tests for examination

,

Viva Questions

,

past year papers

,

Free

,

Previous Year Questions with Solutions

,

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

,

ppt

,

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

,

Semester Notes

,

shortcuts and tricks

,

video lectures

,

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

,

Important questions

,

Summary

;