Scribd
Upload
40 views

Subject Name: Digital Signal Processing Subject Code: 10EC52 Prepared By: S.Kareemulla & Prasanth S G & Archana (TE) Department: ECE Date: 10/11/2014

This document outlines the content of a digital signal processing course. It contains 8 units: 1) DFT and relationships with other transforms, 2) properties of DFT and circular convolution, 3) use of DFT in linear filtering and overlap-save method, 4) FFT algorithms and Goertzel algorithm, chirp-Z transform, 5) IIR filter analog design, 6) structures of IIR filters, 7) FIR filter design, and 8) design of IIR digital filters. The first unit covers topics such as the discrete Fourier transform, inverse discrete Fourier transform, and the relationship between the discrete-time Fourier transform and the discrete Fourier transform.

Uploaded by

mohit
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
40 views

Subject Name: Digital Signal Processing Subject Code: 10EC52 Prepared By: S.Kareemulla & Prasanth S G & Archana (TE) Department: ECE Date: 10/11/2014

This document outlines the content of a digital signal processing course. It contains 8 units: 1) DFT and relationships with other transforms, 2) properties of DFT and circular convolution, 3) use of DFT in linear filtering and overlap-save method, 4) FFT algorithms and Goertzel algorithm, chirp-Z transform, 5) IIR filter analog design, 6) structures of IIR filters, 7) FIR filter design, and 8) design of IIR digital filters. The first unit covers topics such as the discrete Fourier transform, inverse discrete Fourier transform, and the relationship between the discrete-time Fourier transform and the discrete Fourier transform.

Uploaded by

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

Subject Name: Digital Signal Processing

Subject Code: 10EC52

Prepared By: S.Kareemulla & Prasanth S G & Archana(TE)

Department: ECE

Date : 10/11/2014

7/8/2017
UNIT 1: DFT & Relationships with other Transforms
UNIT 2: Properties of DFT & Circular Convolution
UNIT 3: Use of DFT in linear Filtering & overlap and save method
UNIT 4: FFT Algorithms & Goertzal Algorithm , Chirp Z Transorm
UNIT 5 : IIR Filter analog Design
UNIT 6: Structures of IIR Filters
UNIT 7: FIR Filter Design
UNIT 8: Design of IIR Digital Filters

7/8/2017
UNIT 1
DFT & Relationships with other Transforms

7/8/2017
TOPICS COVERED

frequency domain reconstruction


DFT
properties of DFT

7/8/2017
UNIT-1

DFT and IDFT:


Consider an N-sequence xn (at most N non-zero values for 0 n N-1)

(1)

uniformly spaced frequency samples

DFT: (2)

Finite sum! Therefore, its computable.

(3)

(4.21.1) can be rewritten as: (4)

(5)

7/8/2017 Btw, DFT is a sampled version of DTFT.


DFT and IDFT (cont)

Let us verify (5). We multiply both sides by

(6)

(7)

(8)

(8)

7/8/2017
FFT:
(1)
In the matrix form:
(2)

where: (3)

(4)

(5)

(6)

(7)
This is actually FFT
7/8/2017
Relation between DTFT and DFT

1. Sampling of DTFT

(1)

(2)

yn is an infinite sum of shifted replicas of xn. Iff xn is a length M sequence (M N) than yn


= xn. Otherwise, time-domain aliasing xn cannot be recovered!
7/8/2017
Relation between DTFT and DFT (cont)

2. DTFT from DFT by Interpolation

Let xn be a length N sequence:

Let us try to recover DTFT from DFT (its sampled version).

(1)

(2)

(3)

Its possible to determine DTFT X(ej) from its uniformly sampled version uniquely!
7/8/2017
Relation between DTFT and DFT (cont 2)

3. Numerical computation of DTFT from DFT

Let xn is a length N sequence:

defined by N uniformly spaced samples


We wish to evaluate at more dense frequency scale.

(4.26.1)

Define: zero-padding (4.26.2)

(4.26.3)

No change in information, no change in DTFT just a better plot resolution.


7/8/2017
EXAMPLE:
The DFT of a rectangular pulse
x[n] is of length 5
We can consider x[n] of any length greater
than 5
Lets pick N=5
Calculate the DFS of the periodic form of
x[n]

7/8/2017
Example (Contd)

If we consider x[n] of length 10


We get a different set of DFT coefficients
Still samples of the DTFT but in different
places

7/8/2017 12

You might also like